java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label46_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:41:28,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:41:28,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:41:28,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:41:28,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:41:28,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:41:28,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:41:28,208 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:41:28,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:41:28,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:41:28,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:41:28,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:41:28,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:41:28,214 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:41:28,215 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:41:28,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:41:28,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:41:28,219 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:41:28,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:41:28,222 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:41:28,223 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:41:28,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:41:28,227 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:41:28,228 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:41:28,228 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:41:28,229 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:41:28,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:41:28,231 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:41:28,232 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:41:28,233 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:41:28,233 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:41:28,234 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:41:28,234 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:41:28,234 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:41:28,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:41:28,236 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:41:28,236 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 21:41:28,251 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:41:28,252 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:41:28,252 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:41:28,253 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:41:28,253 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:41:28,254 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:41:28,254 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:41:28,254 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:41:28,254 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:41:28,254 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:41:28,255 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:41:28,255 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:41:28,255 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:41:28,255 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:41:28,255 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:41:28,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:41:28,256 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:41:28,256 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:41:28,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:41:28,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:41:28,257 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:41:28,257 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:41:28,257 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:41:28,257 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:41:28,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:41:28,258 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:41:28,258 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:41:28,258 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:41:28,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:41:28,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:41:28,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:41:28,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:41:28,344 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:41:28,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label46_true-unreach-call.c [2018-10-26 21:41:28,413 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3d8fc9ff5/904bfd63b2334acfa499eddeb6152412/FLAG8c2c85301 [2018-10-26 21:41:29,054 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:41:29,055 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label46_true-unreach-call.c [2018-10-26 21:41:29,073 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3d8fc9ff5/904bfd63b2334acfa499eddeb6152412/FLAG8c2c85301 [2018-10-26 21:41:29,089 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3d8fc9ff5/904bfd63b2334acfa499eddeb6152412 [2018-10-26 21:41:29,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:41:29,102 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:41:29,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:41:29,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:41:29,108 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:41:29,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:41:29" (1/1) ... [2018-10-26 21:41:29,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b792d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:29, skipping insertion in model container [2018-10-26 21:41:29,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:41:29" (1/1) ... [2018-10-26 21:41:29,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:41:29,214 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:41:30,058 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:41:30,062 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:41:30,361 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:41:30,383 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:41:30,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30 WrapperNode [2018-10-26 21:41:30,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:41:30,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:41:30,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:41:30,385 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:41:30,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (1/1) ... [2018-10-26 21:41:30,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (1/1) ... [2018-10-26 21:41:30,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:41:30,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:41:30,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:41:30,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:41:30,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (1/1) ... [2018-10-26 21:41:30,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (1/1) ... [2018-10-26 21:41:30,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (1/1) ... [2018-10-26 21:41:30,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (1/1) ... [2018-10-26 21:41:30,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (1/1) ... [2018-10-26 21:41:30,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (1/1) ... [2018-10-26 21:41:30,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (1/1) ... [2018-10-26 21:41:31,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:41:31,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:41:31,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:41:31,027 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:41:31,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:41:31,095 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:41:31,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:41:31,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:41:40,596 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:41:40,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:41:40 BoogieIcfgContainer [2018-10-26 21:41:40,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:41:40,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:41:40,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:41:40,601 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:41:40,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:41:29" (1/3) ... [2018-10-26 21:41:40,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c50117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:41:40, skipping insertion in model container [2018-10-26 21:41:40,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:41:30" (2/3) ... [2018-10-26 21:41:40,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c50117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:41:40, skipping insertion in model container [2018-10-26 21:41:40,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:41:40" (3/3) ... [2018-10-26 21:41:40,605 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label46_true-unreach-call.c [2018-10-26 21:41:40,616 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:41:40,626 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:41:40,644 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:41:40,683 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:41:40,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:41:40,684 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:41:40,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:41:40,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:41:40,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:41:40,685 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:41:40,685 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:41:40,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:41:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-10-26 21:41:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 21:41:40,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:41:40,723 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:41:40,725 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:41:40,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:41:40,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1934902334, now seen corresponding path program 1 times [2018-10-26 21:41:40,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:41:40,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:41:40,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:41:40,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:41:40,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:41:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:41,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:41:41,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:41:41,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:41:41,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:41:41,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:41:41,200 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-10-26 21:41:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:41:48,971 INFO L93 Difference]: Finished difference Result 1473 states and 2723 transitions. [2018-10-26 21:41:48,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:41:48,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-10-26 21:41:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:41:49,004 INFO L225 Difference]: With dead ends: 1473 [2018-10-26 21:41:49,005 INFO L226 Difference]: Without dead ends: 1041 [2018-10-26 21:41:49,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:41:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-10-26 21:41:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1037. [2018-10-26 21:41:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-10-26 21:41:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1674 transitions. [2018-10-26 21:41:49,109 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1674 transitions. Word has length 44 [2018-10-26 21:41:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:41:49,109 INFO L481 AbstractCegarLoop]: Abstraction has 1037 states and 1674 transitions. [2018-10-26 21:41:49,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:41:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1674 transitions. [2018-10-26 21:41:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-26 21:41:49,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:41:49,119 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:41:49,119 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:41:49,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:41:49,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1247411675, now seen corresponding path program 1 times [2018-10-26 21:41:49,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:41:49,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:41:49,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:41:49,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:41:49,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:41:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:49,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:41:49,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:41:49,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:41:49,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:41:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:41:49,487 INFO L87 Difference]: Start difference. First operand 1037 states and 1674 transitions. Second operand 4 states. [2018-10-26 21:41:55,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:41:55,762 INFO L93 Difference]: Finished difference Result 3940 states and 6434 transitions. [2018-10-26 21:41:55,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:41:55,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-10-26 21:41:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:41:55,780 INFO L225 Difference]: With dead ends: 3940 [2018-10-26 21:41:55,780 INFO L226 Difference]: Without dead ends: 2905 [2018-10-26 21:41:55,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:41:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2018-10-26 21:41:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1939. [2018-10-26 21:41:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2018-10-26 21:41:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2819 transitions. [2018-10-26 21:41:55,838 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2819 transitions. Word has length 164 [2018-10-26 21:41:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:41:55,839 INFO L481 AbstractCegarLoop]: Abstraction has 1939 states and 2819 transitions. [2018-10-26 21:41:55,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:41:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2819 transitions. [2018-10-26 21:41:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-26 21:41:55,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:41:55,850 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:41:55,850 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:41:55,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:41:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 390759141, now seen corresponding path program 1 times [2018-10-26 21:41:55,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:41:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:41:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:41:55,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:41:55,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:41:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 21:41:56,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:41:56,635 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:41:56,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:41:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:56,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:41:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:56,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:41:56,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-26 21:41:56,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:41:56,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:41:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:41:56,915 INFO L87 Difference]: Start difference. First operand 1939 states and 2819 transitions. Second operand 4 states. [2018-10-26 21:42:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:42:04,966 INFO L93 Difference]: Finished difference Result 5981 states and 8477 transitions. [2018-10-26 21:42:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:42:04,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2018-10-26 21:42:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:42:04,989 INFO L225 Difference]: With dead ends: 5981 [2018-10-26 21:42:04,990 INFO L226 Difference]: Without dead ends: 4044 [2018-10-26 21:42:04,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:42:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2018-10-26 21:42:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 2539. [2018-10-26 21:42:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2539 states. [2018-10-26 21:42:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 3487 transitions. [2018-10-26 21:42:05,050 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 3487 transitions. Word has length 315 [2018-10-26 21:42:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:42:05,051 INFO L481 AbstractCegarLoop]: Abstraction has 2539 states and 3487 transitions. [2018-10-26 21:42:05,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:42:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3487 transitions. [2018-10-26 21:42:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-26 21:42:05,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:42:05,058 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:42:05,058 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:42:05,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:42:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1752514879, now seen corresponding path program 1 times [2018-10-26 21:42:05,059 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:42:05,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:42:05,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:05,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:42:05,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 21:42:05,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:42:05,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:42:05,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:42:05,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:42:05,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:42:05,762 INFO L87 Difference]: Start difference. First operand 2539 states and 3487 transitions. Second operand 5 states. [2018-10-26 21:42:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:42:12,034 INFO L93 Difference]: Finished difference Result 6278 states and 8294 transitions. [2018-10-26 21:42:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:42:12,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 323 [2018-10-26 21:42:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:42:12,053 INFO L225 Difference]: With dead ends: 6278 [2018-10-26 21:42:12,053 INFO L226 Difference]: Without dead ends: 3741 [2018-10-26 21:42:12,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:42:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2018-10-26 21:42:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3440. [2018-10-26 21:42:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3440 states. [2018-10-26 21:42:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4448 transitions. [2018-10-26 21:42:12,119 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4448 transitions. Word has length 323 [2018-10-26 21:42:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:42:12,120 INFO L481 AbstractCegarLoop]: Abstraction has 3440 states and 4448 transitions. [2018-10-26 21:42:12,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:42:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4448 transitions. [2018-10-26 21:42:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-26 21:42:12,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:42:12,129 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:42:12,129 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:42:12,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:42:12,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1215908209, now seen corresponding path program 1 times [2018-10-26 21:42:12,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:42:12,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:42:12,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:12,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:42:12,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:12,705 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 21:42:13,140 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-26 21:42:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 93 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:13,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:42:13,809 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:42:13,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:42:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:13,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:42:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:14,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:42:14,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-10-26 21:42:14,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:42:14,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:42:14,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:42:14,169 INFO L87 Difference]: Start difference. First operand 3440 states and 4448 transitions. Second operand 9 states. [2018-10-26 21:42:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:42:28,294 INFO L93 Difference]: Finished difference Result 8444 states and 10930 transitions. [2018-10-26 21:42:28,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:42:28,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 397 [2018-10-26 21:42:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:42:28,317 INFO L225 Difference]: With dead ends: 8444 [2018-10-26 21:42:28,317 INFO L226 Difference]: Without dead ends: 5006 [2018-10-26 21:42:28,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 400 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:42:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5006 states. [2018-10-26 21:42:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5006 to 4645. [2018-10-26 21:42:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4645 states. [2018-10-26 21:42:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4645 states to 4645 states and 5663 transitions. [2018-10-26 21:42:28,411 INFO L78 Accepts]: Start accepts. Automaton has 4645 states and 5663 transitions. Word has length 397 [2018-10-26 21:42:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:42:28,412 INFO L481 AbstractCegarLoop]: Abstraction has 4645 states and 5663 transitions. [2018-10-26 21:42:28,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:42:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4645 states and 5663 transitions. [2018-10-26 21:42:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-26 21:42:28,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:42:28,425 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:42:28,426 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:42:28,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:42:28,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1106948331, now seen corresponding path program 1 times [2018-10-26 21:42:28,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:42:28,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:42:28,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:28,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:42:28,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-26 21:42:29,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:42:29,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:42:29,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:42:29,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:42:29,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:42:29,115 INFO L87 Difference]: Start difference. First operand 4645 states and 5663 transitions. Second operand 4 states. [2018-10-26 21:42:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:42:37,154 INFO L93 Difference]: Finished difference Result 10191 states and 12538 transitions. [2018-10-26 21:42:37,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:42:37,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 416 [2018-10-26 21:42:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:42:37,178 INFO L225 Difference]: With dead ends: 10191 [2018-10-26 21:42:37,178 INFO L226 Difference]: Without dead ends: 5548 [2018-10-26 21:42:37,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:42:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2018-10-26 21:42:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5546. [2018-10-26 21:42:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5546 states. [2018-10-26 21:42:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 6603 transitions. [2018-10-26 21:42:37,283 INFO L78 Accepts]: Start accepts. Automaton has 5546 states and 6603 transitions. Word has length 416 [2018-10-26 21:42:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:42:37,284 INFO L481 AbstractCegarLoop]: Abstraction has 5546 states and 6603 transitions. [2018-10-26 21:42:37,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:42:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 6603 transitions. [2018-10-26 21:42:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2018-10-26 21:42:37,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:42:37,300 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:42:37,300 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:42:37,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:42:37,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1134081088, now seen corresponding path program 1 times [2018-10-26 21:42:37,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:42:37,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:42:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:37,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:42:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-10-26 21:42:37,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:42:37,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:42:37,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:42:37,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:42:37,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:42:37,728 INFO L87 Difference]: Start difference. First operand 5546 states and 6603 transitions. Second operand 3 states. [2018-10-26 21:42:40,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:42:40,795 INFO L93 Difference]: Finished difference Result 12889 states and 15642 transitions. [2018-10-26 21:42:40,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:42:40,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2018-10-26 21:42:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:42:40,824 INFO L225 Difference]: With dead ends: 12889 [2018-10-26 21:42:40,824 INFO L226 Difference]: Without dead ends: 7345 [2018-10-26 21:42:40,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:42:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7345 states. [2018-10-26 21:42:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7345 to 7345. [2018-10-26 21:42:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7345 states. [2018-10-26 21:42:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7345 states to 7345 states and 8785 transitions. [2018-10-26 21:42:40,957 INFO L78 Accepts]: Start accepts. Automaton has 7345 states and 8785 transitions. Word has length 511 [2018-10-26 21:42:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:42:40,958 INFO L481 AbstractCegarLoop]: Abstraction has 7345 states and 8785 transitions. [2018-10-26 21:42:40,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:42:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 7345 states and 8785 transitions. [2018-10-26 21:42:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-10-26 21:42:40,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:42:40,969 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:42:40,970 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:42:40,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:42:40,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1637939412, now seen corresponding path program 1 times [2018-10-26 21:42:40,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:42:40,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:42:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:40,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:42:40,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:41,694 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-26 21:42:42,036 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-26 21:42:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 620 proven. 4 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-26 21:42:42,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:42:42,736 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:42:42,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:42:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:42,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:42:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 585 proven. 39 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-26 21:42:43,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:42:43,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-26 21:42:43,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:42:43,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:42:43,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:42:43,938 INFO L87 Difference]: Start difference. First operand 7345 states and 8785 transitions. Second operand 9 states. [2018-10-26 21:42:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:42:59,561 INFO L93 Difference]: Finished difference Result 20557 states and 24375 transitions. [2018-10-26 21:42:59,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:42:59,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 603 [2018-10-26 21:42:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:42:59,590 INFO L225 Difference]: With dead ends: 20557 [2018-10-26 21:42:59,591 INFO L226 Difference]: Without dead ends: 8495 [2018-10-26 21:42:59,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 600 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:42:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8495 states. [2018-10-26 21:42:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8495 to 5494. [2018-10-26 21:42:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2018-10-26 21:42:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 5979 transitions. [2018-10-26 21:42:59,688 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 5979 transitions. Word has length 603 [2018-10-26 21:42:59,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:42:59,689 INFO L481 AbstractCegarLoop]: Abstraction has 5494 states and 5979 transitions. [2018-10-26 21:42:59,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:42:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 5979 transitions. [2018-10-26 21:42:59,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2018-10-26 21:42:59,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:42:59,697 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:42:59,697 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:42:59,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:42:59,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1980651932, now seen corresponding path program 1 times [2018-10-26 21:42:59,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:42:59,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:42:59,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:59,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:42:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:42:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:43:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-10-26 21:43:00,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:43:00,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:43:00,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:43:00,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:43:00,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:43:00,183 INFO L87 Difference]: Start difference. First operand 5494 states and 5979 transitions. Second operand 3 states. [2018-10-26 21:43:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:43:01,997 INFO L93 Difference]: Finished difference Result 10984 states and 11954 transitions. [2018-10-26 21:43:01,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:43:01,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 645 [2018-10-26 21:43:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:43:02,008 INFO L225 Difference]: With dead ends: 10984 [2018-10-26 21:43:02,008 INFO L226 Difference]: Without dead ends: 5492 [2018-10-26 21:43:02,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:43:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2018-10-26 21:43:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 5492. [2018-10-26 21:43:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5492 states. [2018-10-26 21:43:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 5975 transitions. [2018-10-26 21:43:02,088 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 5975 transitions. Word has length 645 [2018-10-26 21:43:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:43:02,089 INFO L481 AbstractCegarLoop]: Abstraction has 5492 states and 5975 transitions. [2018-10-26 21:43:02,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:43:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 5975 transitions. [2018-10-26 21:43:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-26 21:43:02,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:43:02,098 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:43:02,098 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:43:02,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:43:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash 280923292, now seen corresponding path program 1 times [2018-10-26 21:43:02,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:43:02,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:43:02,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:43:02,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:43:02,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:43:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:43:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2018-10-26 21:43:02,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:43:02,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:43:02,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:43:02,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:43:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:43:02,695 INFO L87 Difference]: Start difference. First operand 5492 states and 5975 transitions. Second operand 3 states. [2018-10-26 21:43:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:43:04,593 INFO L93 Difference]: Finished difference Result 13994 states and 15196 transitions. [2018-10-26 21:43:04,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:43:04,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 672 [2018-10-26 21:43:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:43:04,611 INFO L225 Difference]: With dead ends: 13994 [2018-10-26 21:43:04,612 INFO L226 Difference]: Without dead ends: 8195 [2018-10-26 21:43:04,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:43:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8195 states. [2018-10-26 21:43:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8195 to 7283. [2018-10-26 21:43:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7283 states. [2018-10-26 21:43:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 7851 transitions. [2018-10-26 21:43:04,722 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 7851 transitions. Word has length 672 [2018-10-26 21:43:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:43:04,723 INFO L481 AbstractCegarLoop]: Abstraction has 7283 states and 7851 transitions. [2018-10-26 21:43:04,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:43:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 7851 transitions. [2018-10-26 21:43:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2018-10-26 21:43:04,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:43:04,735 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:43:04,735 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:43:04,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:43:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1634190814, now seen corresponding path program 1 times [2018-10-26 21:43:04,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:43:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:43:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:43:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:43:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:43:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:43:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2018-10-26 21:43:05,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:43:05,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:43:05,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:43:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:43:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:43:05,369 INFO L87 Difference]: Start difference. First operand 7283 states and 7851 transitions. Second operand 5 states. [2018-10-26 21:43:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:43:08,425 INFO L93 Difference]: Finished difference Result 15733 states and 16913 transitions. [2018-10-26 21:43:08,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:43:08,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 705 [2018-10-26 21:43:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:43:08,439 INFO L225 Difference]: With dead ends: 15733 [2018-10-26 21:43:08,439 INFO L226 Difference]: Without dead ends: 8150 [2018-10-26 21:43:08,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:43:08,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8150 states. [2018-10-26 21:43:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8150 to 6650. [2018-10-26 21:43:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6650 states. [2018-10-26 21:43:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6650 states to 6650 states and 6936 transitions. [2018-10-26 21:43:08,531 INFO L78 Accepts]: Start accepts. Automaton has 6650 states and 6936 transitions. Word has length 705 [2018-10-26 21:43:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:43:08,531 INFO L481 AbstractCegarLoop]: Abstraction has 6650 states and 6936 transitions. [2018-10-26 21:43:08,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:43:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 6650 states and 6936 transitions. [2018-10-26 21:43:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2018-10-26 21:43:08,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:43:08,546 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:43:08,546 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:43:08,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:43:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2037198302, now seen corresponding path program 1 times [2018-10-26 21:43:08,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:43:08,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:43:08,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:43:08,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:43:08,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:43:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:43:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-10-26 21:43:09,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:43:09,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:43:09,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:43:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:43:09,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:43:09,519 INFO L87 Difference]: Start difference. First operand 6650 states and 6936 transitions. Second operand 3 states. [2018-10-26 21:43:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:43:10,738 INFO L93 Difference]: Finished difference Result 15097 states and 15800 transitions. [2018-10-26 21:43:10,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:43:10,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 920 [2018-10-26 21:43:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:43:10,746 INFO L225 Difference]: With dead ends: 15097 [2018-10-26 21:43:10,746 INFO L226 Difference]: Without dead ends: 8749 [2018-10-26 21:43:10,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:43:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8749 states. [2018-10-26 21:43:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8749 to 8149. [2018-10-26 21:43:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8149 states. [2018-10-26 21:43:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8149 states to 8149 states and 8478 transitions. [2018-10-26 21:43:10,849 INFO L78 Accepts]: Start accepts. Automaton has 8149 states and 8478 transitions. Word has length 920 [2018-10-26 21:43:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:43:10,850 INFO L481 AbstractCegarLoop]: Abstraction has 8149 states and 8478 transitions. [2018-10-26 21:43:10,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:43:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 8149 states and 8478 transitions. [2018-10-26 21:43:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2018-10-26 21:43:10,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:43:10,868 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:43:10,869 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:43:10,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:43:10,869 INFO L82 PathProgramCache]: Analyzing trace with hash 103677985, now seen corresponding path program 1 times [2018-10-26 21:43:10,870 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:43:10,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:43:10,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:43:10,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:43:10,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:43:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:43:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 42 proven. 717 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-10-26 21:43:12,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:43:12,890 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:43:12,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:43:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:43:13,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:43:14,687 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_825 Int)) (and (<= (+ v_~a0~0_825 44) 0) (<= (mod v_~a0~0_825 299926) (+ c_~a0~0 300074)) (<= 0 v_~a0~0_825))) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 299926))) (and (not (= .cse0 0)) (< v_prenex_1 0) (<= (+ v_prenex_1 44) 0) (<= .cse0 (+ c_~a0~0 600000))))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (= .cse1 0) (<= (+ v_prenex_2 44) 0) (<= .cse1 (+ c_~a0~0 300074)))))) is different from true [2018-10-26 21:43:15,394 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2018-10-26 21:43:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 483 trivial. 634 not checked. [2018-10-26 21:43:19,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:43:19,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-26 21:43:19,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:43:19,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:43:19,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2018-10-26 21:43:19,006 INFO L87 Difference]: Start difference. First operand 8149 states and 8478 transitions. Second operand 9 states. [2018-10-26 21:43:28,047 WARN L179 SmtUtils]: Spent 5.30 s on a formula simplification. DAG size of input: 39 DAG size of output: 19 [2018-10-26 21:43:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:43:35,424 INFO L93 Difference]: Finished difference Result 15611 states and 16209 transitions. [2018-10-26 21:43:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 21:43:35,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 941 [2018-10-26 21:43:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:43:35,428 INFO L225 Difference]: With dead ends: 15611 [2018-10-26 21:43:35,428 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:43:35,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 938 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=35, Invalid=57, Unknown=2, NotChecked=16, Total=110 [2018-10-26 21:43:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:43:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:43:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:43:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:43:35,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 941 [2018-10-26 21:43:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:43:35,439 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:43:35,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:43:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:43:35,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:43:35,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:43:35,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,697 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 201 [2018-10-26 21:43:35,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:35,948 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 201 [2018-10-26 21:43:36,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:36,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:36,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:43:36,103 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 174 [2018-10-26 21:45:15,107 WARN L179 SmtUtils]: Spent 1.65 m on a formula simplification. DAG size of input: 185 DAG size of output: 69 Received shutdown request... [2018-10-26 21:45:39,877 WARN L187 SmtUtils]: Removed 28 from assertion stack [2018-10-26 21:45:39,878 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-10-26 21:45:39,879 INFO L168 Benchmark]: Toolchain (without parser) took 250777.83 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -286.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-26 21:45:39,880 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:45:39,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1280.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-10-26 21:45:39,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 420.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -873.0 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:45:39,883 INFO L168 Benchmark]: Boogie Preprocessor took 221.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2018-10-26 21:45:39,884 INFO L168 Benchmark]: RCFGBuilder took 9570.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 306.6 MB). Peak memory consumption was 306.6 MB. Max. memory is 7.1 GB. [2018-10-26 21:45:39,885 INFO L168 Benchmark]: TraceAbstraction took 239280.45 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 1.9 GB in the beginning and 1.7 GB in the end (delta: 145.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-26 21:45:39,891 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1280.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 420.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -873.0 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 221.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9570.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 306.6 MB). Peak memory consumption was 306.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239280.45 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 1.9 GB in the beginning and 1.7 GB in the end (delta: 145.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 185. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown