java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:24:26,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:24:26,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:24:26,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:24:26,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:24:26,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:24:26,102 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:24:26,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:24:26,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:24:26,106 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:24:26,107 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:24:26,108 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:24:26,109 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:24:26,110 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:24:26,111 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:24:26,113 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:24:26,115 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:24:26,117 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:24:26,118 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:24:26,120 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:24:26,122 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:24:26,122 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:24:26,122 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:24:26,123 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:24:26,124 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:24:26,126 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:24:26,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:24:26,126 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:24:26,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:24:26,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:24:26,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:24:26,128 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:24:26,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:24:26,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:24:26,137 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:24:26,137 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:24:26,137 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:24:26,137 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:24:26,138 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:24:26,138 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:24:26,138 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:24:26,138 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:24:26,138 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:24:26,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:24:26,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:24:26,139 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:24:26,139 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:24:26,139 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:24:26,139 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:24:26,139 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:24:26,139 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:24:26,139 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:24:26,140 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:24:26,140 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:24:26,140 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:24:26,140 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:24:26,140 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:24:26,141 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:24:26,141 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:24:26,141 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:24:26,141 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:24:26,141 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:24:26,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:24:26,141 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:24:26,142 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:24:26,142 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:24:26,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:24:26,184 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:24:26,187 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:24:26,188 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:24:26,189 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:24:26,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-30 00:24:26,350 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:24:26,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:24:26,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:24:26,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:24:26,360 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:24:26,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:24:26" (1/1) ... [2018-01-30 00:24:26,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf95c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26, skipping insertion in model container [2018-01-30 00:24:26,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:24:26" (1/1) ... [2018-01-30 00:24:26,376 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:24:26,416 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:24:26,537 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:24:26,562 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:24:26,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26 WrapperNode [2018-01-30 00:24:26,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:24:26,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:24:26,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:24:26,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:24:26,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26" (1/1) ... [2018-01-30 00:24:26,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26" (1/1) ... [2018-01-30 00:24:26,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26" (1/1) ... [2018-01-30 00:24:26,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26" (1/1) ... [2018-01-30 00:24:26,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26" (1/1) ... [2018-01-30 00:24:26,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26" (1/1) ... [2018-01-30 00:24:26,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26" (1/1) ... [2018-01-30 00:24:26,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:24:26,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:24:26,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:24:26,612 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:24:26,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-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-01-30 00:24:26,664 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:24:26,664 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:24:26,664 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:24:26,664 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:24:26,664 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:24:26,665 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:24:26,665 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:24:26,665 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:24:26,665 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:24:26,665 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:24:26,665 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:24:26,666 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:24:26,666 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:24:26,666 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:24:26,666 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:24:26,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:24:26,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:24:27,131 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:24:27,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:24:27 BoogieIcfgContainer [2018-01-30 00:24:27,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:24:27,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:24:27,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:24:27,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:24:27,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:24:26" (1/3) ... [2018-01-30 00:24:27,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d384453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:24:27, skipping insertion in model container [2018-01-30 00:24:27,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:24:26" (2/3) ... [2018-01-30 00:24:27,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d384453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:24:27, skipping insertion in model container [2018-01-30 00:24:27,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:24:27" (3/3) ... [2018-01-30 00:24:27,137 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-30 00:24:27,144 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:24:27,150 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-30 00:24:27,199 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:24:27,199 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:24:27,199 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:24:27,199 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:24:27,199 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:24:27,199 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:24:27,199 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:24:27,199 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:24:27,200 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:24:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2018-01-30 00:24:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:24:27,221 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:27,221 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:24:27,221 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash -285560507, now seen corresponding path program 1 times [2018-01-30 00:24:27,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:27,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:27,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:27,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:27,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:27,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:27,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:27,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:24:27,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:24:27,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:24:27,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:24:27,492 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 4 states. [2018-01-30 00:24:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:27,744 INFO L93 Difference]: Finished difference Result 287 states and 325 transitions. [2018-01-30 00:24:27,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:24:27,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:24:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:27,756 INFO L225 Difference]: With dead ends: 287 [2018-01-30 00:24:27,756 INFO L226 Difference]: Without dead ends: 174 [2018-01-30 00:24:27,760 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:24:27,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-30 00:24:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2018-01-30 00:24:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-30 00:24:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-01-30 00:24:27,804 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 9 [2018-01-30 00:24:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:27,804 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-01-30 00:24:27,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:24:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-01-30 00:24:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:24:27,805 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:27,805 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:24:27,805 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash -285560506, now seen corresponding path program 1 times [2018-01-30 00:24:27,806 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:27,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:27,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:27,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:27,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:27,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:27,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:27,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:24:27,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:24:27,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:24:27,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:24:27,891 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 4 states. [2018-01-30 00:24:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:28,098 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2018-01-30 00:24:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:24:28,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:24:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:28,100 INFO L225 Difference]: With dead ends: 160 [2018-01-30 00:24:28,100 INFO L226 Difference]: Without dead ends: 158 [2018-01-30 00:24:28,102 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:24:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-30 00:24:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2018-01-30 00:24:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-30 00:24:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-01-30 00:24:28,114 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 9 [2018-01-30 00:24:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:28,115 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-01-30 00:24:28,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:24:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-01-30 00:24:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-30 00:24:28,116 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:28,116 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:24:28,116 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash -876101332, now seen corresponding path program 1 times [2018-01-30 00:24:28,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:28,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:28,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:28,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:28,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:28,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:28,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:28,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:24:28,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:24:28,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:24:28,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:24:28,215 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 4 states. [2018-01-30 00:24:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:28,393 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-01-30 00:24:28,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:24:28,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-30 00:24:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:28,395 INFO L225 Difference]: With dead ends: 143 [2018-01-30 00:24:28,395 INFO L226 Difference]: Without dead ends: 127 [2018-01-30 00:24:28,396 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:24:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-30 00:24:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2018-01-30 00:24:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-30 00:24:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2018-01-30 00:24:28,405 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 17 [2018-01-30 00:24:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:28,405 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2018-01-30 00:24:28,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:24:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2018-01-30 00:24:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-30 00:24:28,406 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:28,406 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:24:28,406 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash -876101331, now seen corresponding path program 1 times [2018-01-30 00:24:28,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:28,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:28,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:28,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:28,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:28,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:28,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:28,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:24:28,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:24:28,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:24:28,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:24:28,505 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 7 states. [2018-01-30 00:24:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:28,856 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2018-01-30 00:24:28,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:24:28,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-30 00:24:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:28,858 INFO L225 Difference]: With dead ends: 219 [2018-01-30 00:24:28,859 INFO L226 Difference]: Without dead ends: 206 [2018-01-30 00:24:28,859 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:24:28,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-30 00:24:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 177. [2018-01-30 00:24:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-30 00:24:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2018-01-30 00:24:28,876 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 17 [2018-01-30 00:24:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:28,877 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2018-01-30 00:24:28,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:24:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2018-01-30 00:24:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 00:24:28,878 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:28,878 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:24:28,878 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2079112080, now seen corresponding path program 1 times [2018-01-30 00:24:28,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:28,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:28,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:28,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:28,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:28,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:28,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:28,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:24:28,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:24:28,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:24:28,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:24:28,924 INFO L87 Difference]: Start difference. First operand 177 states and 201 transitions. Second operand 4 states. [2018-01-30 00:24:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:29,030 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2018-01-30 00:24:29,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:24:29,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-30 00:24:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:29,031 INFO L225 Difference]: With dead ends: 197 [2018-01-30 00:24:29,032 INFO L226 Difference]: Without dead ends: 196 [2018-01-30 00:24:29,032 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:24:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-30 00:24:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2018-01-30 00:24:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-30 00:24:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2018-01-30 00:24:29,045 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 21 [2018-01-30 00:24:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:29,046 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2018-01-30 00:24:29,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:24:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2018-01-30 00:24:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 00:24:29,047 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:29,047 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:24:29,047 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:29,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2079112081, now seen corresponding path program 1 times [2018-01-30 00:24:29,048 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:29,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:29,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:29,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:29,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:29,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:29,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:29,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:24:29,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:24:29,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:24:29,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:24:29,112 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 4 states. [2018-01-30 00:24:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:29,251 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2018-01-30 00:24:29,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:24:29,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-30 00:24:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:29,252 INFO L225 Difference]: With dead ends: 197 [2018-01-30 00:24:29,252 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 00:24:29,252 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:24:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 00:24:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 174. [2018-01-30 00:24:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-30 00:24:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 198 transitions. [2018-01-30 00:24:29,263 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 198 transitions. Word has length 21 [2018-01-30 00:24:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:29,263 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 198 transitions. [2018-01-30 00:24:29,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:24:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 198 transitions. [2018-01-30 00:24:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 00:24:29,264 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:29,264 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:24:29,264 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash 845772272, now seen corresponding path program 1 times [2018-01-30 00:24:29,264 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:29,264 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:29,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:29,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:29,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:29,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:29,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:29,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:24:29,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:24:29,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:24:29,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:24:29,320 INFO L87 Difference]: Start difference. First operand 174 states and 198 transitions. Second operand 6 states. [2018-01-30 00:24:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:29,570 INFO L93 Difference]: Finished difference Result 305 states and 348 transitions. [2018-01-30 00:24:29,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:24:29,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-30 00:24:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:29,573 INFO L225 Difference]: With dead ends: 305 [2018-01-30 00:24:29,573 INFO L226 Difference]: Without dead ends: 304 [2018-01-30 00:24:29,573 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:24:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-30 00:24:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 173. [2018-01-30 00:24:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-30 00:24:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 197 transitions. [2018-01-30 00:24:29,583 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 197 transitions. Word has length 21 [2018-01-30 00:24:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:29,583 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 197 transitions. [2018-01-30 00:24:29,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:24:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 197 transitions. [2018-01-30 00:24:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 00:24:29,584 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:29,584 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:24:29,584 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:29,584 INFO L82 PathProgramCache]: Analyzing trace with hash 845772273, now seen corresponding path program 1 times [2018-01-30 00:24:29,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:29,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:29,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:29,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:29,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:29,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:29,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:29,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:24:29,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:24:29,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:24:29,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:24:29,694 INFO L87 Difference]: Start difference. First operand 173 states and 197 transitions. Second operand 6 states. [2018-01-30 00:24:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:30,040 INFO L93 Difference]: Finished difference Result 314 states and 360 transitions. [2018-01-30 00:24:30,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:24:30,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-30 00:24:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:30,042 INFO L225 Difference]: With dead ends: 314 [2018-01-30 00:24:30,043 INFO L226 Difference]: Without dead ends: 310 [2018-01-30 00:24:30,043 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:24:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-01-30 00:24:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 162. [2018-01-30 00:24:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-30 00:24:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 185 transitions. [2018-01-30 00:24:30,060 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 185 transitions. Word has length 21 [2018-01-30 00:24:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:30,061 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 185 transitions. [2018-01-30 00:24:30,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:24:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 185 transitions. [2018-01-30 00:24:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 00:24:30,064 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:30,065 INFO L350 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] [2018-01-30 00:24:30,065 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash 682585211, now seen corresponding path program 1 times [2018-01-30 00:24:30,065 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:30,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:30,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:30,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:30,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:30,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:30,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:30,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:24:30,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:24:30,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:24:30,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:24:30,158 INFO L87 Difference]: Start difference. First operand 162 states and 185 transitions. Second operand 5 states. [2018-01-30 00:24:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:30,618 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2018-01-30 00:24:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:24:30,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-30 00:24:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:30,620 INFO L225 Difference]: With dead ends: 204 [2018-01-30 00:24:30,620 INFO L226 Difference]: Without dead ends: 199 [2018-01-30 00:24:30,620 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:24:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-30 00:24:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 132. [2018-01-30 00:24:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-30 00:24:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-01-30 00:24:30,628 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 26 [2018-01-30 00:24:30,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:30,628 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-01-30 00:24:30,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:24:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-01-30 00:24:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:24:30,629 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:30,629 INFO L350 BasicCegarLoop]: trace histogram [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-01-30 00:24:30,630 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:30,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1858449896, now seen corresponding path program 1 times [2018-01-30 00:24:30,630 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:30,630 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:30,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:30,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:30,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:30,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:30,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:30,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:24:30,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:24:30,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:24:30,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:24:30,774 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 5 states. [2018-01-30 00:24:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:30,924 INFO L93 Difference]: Finished difference Result 251 states and 271 transitions. [2018-01-30 00:24:30,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:24:30,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-30 00:24:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:30,925 INFO L225 Difference]: With dead ends: 251 [2018-01-30 00:24:30,925 INFO L226 Difference]: Without dead ends: 156 [2018-01-30 00:24:30,926 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:24:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-30 00:24:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2018-01-30 00:24:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-30 00:24:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2018-01-30 00:24:30,938 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 31 [2018-01-30 00:24:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:30,938 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2018-01-30 00:24:30,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:24:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2018-01-30 00:24:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:24:30,940 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:30,940 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:24:30,940 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:30,940 INFO L82 PathProgramCache]: Analyzing trace with hash 125549571, now seen corresponding path program 1 times [2018-01-30 00:24:30,940 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:30,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:30,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:30,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:30,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:30,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:31,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:24:31,102 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-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-01-30 00:24:31,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:31,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:24:31,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:24:31,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:31,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:31,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:24:31,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:31,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:31,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:31,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:31,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:31,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-30 00:24:31,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-30 00:24:31,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-30 00:24:31,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:31,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:31,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:24:31,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-01-30 00:24:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:31,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:24:31,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-01-30 00:24:31,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:24:31,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:24:31,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:24:31,450 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 13 states. [2018-01-30 00:24:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:32,230 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2018-01-30 00:24:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:24:32,231 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-30 00:24:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:32,232 INFO L225 Difference]: With dead ends: 198 [2018-01-30 00:24:32,232 INFO L226 Difference]: Without dead ends: 196 [2018-01-30 00:24:32,232 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:24:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-30 00:24:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 152. [2018-01-30 00:24:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-30 00:24:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2018-01-30 00:24:32,243 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 33 [2018-01-30 00:24:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:32,244 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2018-01-30 00:24:32,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:24:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2018-01-30 00:24:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:24:32,245 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:32,245 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:24:32,245 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:32,246 INFO L82 PathProgramCache]: Analyzing trace with hash 125549572, now seen corresponding path program 1 times [2018-01-30 00:24:32,246 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:32,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:32,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:32,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:32,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:32,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:32,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:24:32,583 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-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-01-30 00:24:32,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:32,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:24:32,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:24:32,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:32,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:32,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:24:32,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-01-30 00:24:32,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:32,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:32,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-01-30 00:24:32,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:32,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:32,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:32,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:32,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:32,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:32,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:32,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:32,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:32,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2018-01-30 00:24:33,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-30 00:24:33,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-30 00:24:33,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:33,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:33,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-30 00:24:33,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-30 00:24:33,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:33,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:33,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:24:33,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2018-01-30 00:24:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:33,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:24:33,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-01-30 00:24:33,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:24:33,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:24:33,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:24:33,165 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand 17 states. [2018-01-30 00:24:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:34,104 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-01-30 00:24:34,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 00:24:34,104 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-01-30 00:24:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:34,105 INFO L225 Difference]: With dead ends: 229 [2018-01-30 00:24:34,105 INFO L226 Difference]: Without dead ends: 226 [2018-01-30 00:24:34,106 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:24:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-30 00:24:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 150. [2018-01-30 00:24:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-30 00:24:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2018-01-30 00:24:34,114 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 33 [2018-01-30 00:24:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:34,114 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2018-01-30 00:24:34,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:24:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2018-01-30 00:24:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:24:34,115 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:34,115 INFO L350 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] [2018-01-30 00:24:34,115 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:34,116 INFO L82 PathProgramCache]: Analyzing trace with hash 532749667, now seen corresponding path program 1 times [2018-01-30 00:24:34,116 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:34,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:34,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:34,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:34,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:34,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:34,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:34,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:24:34,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:24:34,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:24:34,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:24:34,210 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand 9 states. [2018-01-30 00:24:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:34,443 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2018-01-30 00:24:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:24:34,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-30 00:24:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:34,445 INFO L225 Difference]: With dead ends: 207 [2018-01-30 00:24:34,445 INFO L226 Difference]: Without dead ends: 206 [2018-01-30 00:24:34,445 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:24:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-30 00:24:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 157. [2018-01-30 00:24:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-30 00:24:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2018-01-30 00:24:34,454 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 34 [2018-01-30 00:24:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:34,454 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2018-01-30 00:24:34,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:24:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2018-01-30 00:24:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:24:34,455 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:34,455 INFO L350 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] [2018-01-30 00:24:34,455 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:34,455 INFO L82 PathProgramCache]: Analyzing trace with hash 532749668, now seen corresponding path program 1 times [2018-01-30 00:24:34,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:34,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:34,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:34,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:34,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:34,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:34,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:34,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:24:34,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:24:34,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:24:34,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:24:34,928 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand 8 states. [2018-01-30 00:24:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:35,303 INFO L93 Difference]: Finished difference Result 235 states and 251 transitions. [2018-01-30 00:24:35,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:24:35,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-30 00:24:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:35,305 INFO L225 Difference]: With dead ends: 235 [2018-01-30 00:24:35,305 INFO L226 Difference]: Without dead ends: 233 [2018-01-30 00:24:35,305 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:24:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-30 00:24:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 160. [2018-01-30 00:24:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-30 00:24:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2018-01-30 00:24:35,313 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 34 [2018-01-30 00:24:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:35,314 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2018-01-30 00:24:35,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:24:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2018-01-30 00:24:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:24:35,315 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:35,315 INFO L350 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] [2018-01-30 00:24:35,315 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:35,315 INFO L82 PathProgramCache]: Analyzing trace with hash -195766224, now seen corresponding path program 1 times [2018-01-30 00:24:35,315 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:35,315 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:35,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:35,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:35,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:35,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:35,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:35,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:24:35,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:24:35,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:24:35,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:24:35,388 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand 5 states. [2018-01-30 00:24:35,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:35,524 INFO L93 Difference]: Finished difference Result 223 states and 240 transitions. [2018-01-30 00:24:35,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:24:35,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-30 00:24:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:35,525 INFO L225 Difference]: With dead ends: 223 [2018-01-30 00:24:35,526 INFO L226 Difference]: Without dead ends: 220 [2018-01-30 00:24:35,526 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:24:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-30 00:24:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 189. [2018-01-30 00:24:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-30 00:24:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2018-01-30 00:24:35,537 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 38 [2018-01-30 00:24:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:35,538 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2018-01-30 00:24:35,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:24:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2018-01-30 00:24:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-30 00:24:35,538 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:35,538 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:24:35,539 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:35,539 INFO L82 PathProgramCache]: Analyzing trace with hash -151858574, now seen corresponding path program 1 times [2018-01-30 00:24:35,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:35,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:35,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:35,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:35,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:35,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:35,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:35,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:24:35,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:24:35,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:24:35,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:24:35,851 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 9 states. [2018-01-30 00:24:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:36,179 INFO L93 Difference]: Finished difference Result 300 states and 321 transitions. [2018-01-30 00:24:36,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:24:36,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-30 00:24:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:36,180 INFO L225 Difference]: With dead ends: 300 [2018-01-30 00:24:36,180 INFO L226 Difference]: Without dead ends: 251 [2018-01-30 00:24:36,181 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:24:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-01-30 00:24:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 193. [2018-01-30 00:24:36,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-30 00:24:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2018-01-30 00:24:36,200 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 40 [2018-01-30 00:24:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:36,200 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2018-01-30 00:24:36,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:24:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2018-01-30 00:24:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-30 00:24:36,201 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:36,202 INFO L350 BasicCegarLoop]: trace histogram [3, 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] [2018-01-30 00:24:36,202 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1065979994, now seen corresponding path program 2 times [2018-01-30 00:24:36,202 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:36,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:36,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:36,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:36,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:36,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 00:24:36,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:36,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 00:24:36,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:24:36,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:24:36,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:24:36,402 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand 11 states. [2018-01-30 00:24:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:36,838 INFO L93 Difference]: Finished difference Result 254 states and 272 transitions. [2018-01-30 00:24:36,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:24:36,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-01-30 00:24:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:36,839 INFO L225 Difference]: With dead ends: 254 [2018-01-30 00:24:36,840 INFO L226 Difference]: Without dead ends: 196 [2018-01-30 00:24:36,840 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:24:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-30 00:24:36,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2018-01-30 00:24:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-30 00:24:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2018-01-30 00:24:36,850 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 40 [2018-01-30 00:24:36,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:36,850 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2018-01-30 00:24:36,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:24:36,850 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2018-01-30 00:24:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-30 00:24:36,850 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:36,850 INFO L350 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] [2018-01-30 00:24:36,851 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:36,851 INFO L82 PathProgramCache]: Analyzing trace with hash 523031764, now seen corresponding path program 1 times [2018-01-30 00:24:36,851 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:36,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:36,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:36,852 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:24:36,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:36,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:37,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:37,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 00:24:37,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:24:37,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:24:37,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:24:37,086 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand 11 states. [2018-01-30 00:24:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:38,361 INFO L93 Difference]: Finished difference Result 252 states and 271 transitions. [2018-01-30 00:24:38,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:24:38,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-30 00:24:38,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:38,362 INFO L225 Difference]: With dead ends: 252 [2018-01-30 00:24:38,362 INFO L226 Difference]: Without dead ends: 220 [2018-01-30 00:24:38,363 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:24:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-30 00:24:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 188. [2018-01-30 00:24:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-30 00:24:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 205 transitions. [2018-01-30 00:24:38,374 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 205 transitions. Word has length 41 [2018-01-30 00:24:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:38,375 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 205 transitions. [2018-01-30 00:24:38,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:24:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 205 transitions. [2018-01-30 00:24:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:24:38,375 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:38,375 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:24:38,375 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1922817663, now seen corresponding path program 1 times [2018-01-30 00:24:38,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:38,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:38,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:38,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:38,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:38,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:38,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:24:38,999 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-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-01-30 00:24:39,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:39,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:24:39,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:39,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:39,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:39,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:39,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-01-30 00:24:39,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-30 00:24:39,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:39,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-30 00:24:39,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-30 00:24:39,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:39,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-30 00:24:39,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2018-01-30 00:24:39,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:39,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:39,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-30 00:24:39,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-01-30 00:24:39,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-30 00:24:39,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-30 00:24:39,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-30 00:24:39,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-30 00:24:39,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:22 [2018-01-30 00:24:39,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-30 00:24:39,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:39,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-01-30 00:24:39,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:39,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,262 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:38 [2018-01-30 00:24:39,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-01-30 00:24:39,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-01-30 00:24:39,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-01-30 00:24:39,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:24:39,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:24:39,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-30 00:24:39,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-30 00:24:39,450 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-01-30 00:24:39,458 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,461 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:39,464 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2018-01-30 00:24:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:39,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:24:39,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-01-30 00:24:39,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 00:24:39,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 00:24:39,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=318, Unknown=15, NotChecked=0, Total=380 [2018-01-30 00:24:39,508 INFO L87 Difference]: Start difference. First operand 188 states and 205 transitions. Second operand 20 states. [2018-01-30 00:24:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:40,291 INFO L93 Difference]: Finished difference Result 272 states and 289 transitions. [2018-01-30 00:24:40,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:24:40,324 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-01-30 00:24:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:40,325 INFO L225 Difference]: With dead ends: 272 [2018-01-30 00:24:40,325 INFO L226 Difference]: Without dead ends: 240 [2018-01-30 00:24:40,326 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=1312, Unknown=18, NotChecked=0, Total=1560 [2018-01-30 00:24:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-30 00:24:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 212. [2018-01-30 00:24:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-30 00:24:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 230 transitions. [2018-01-30 00:24:40,339 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 230 transitions. Word has length 42 [2018-01-30 00:24:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:40,339 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 230 transitions. [2018-01-30 00:24:40,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 00:24:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 230 transitions. [2018-01-30 00:24:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:24:40,340 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:40,340 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:24:40,340 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:40,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1282423572, now seen corresponding path program 1 times [2018-01-30 00:24:40,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:40,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:40,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:40,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:40,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:40,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:40,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:24:40,487 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-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-01-30 00:24:40,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:40,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:24:40,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:40,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:40,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-30 00:24:40,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-30 00:24:40,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:40,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:40,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-30 00:24:40,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:40,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-30 00:24:40,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-30 00:24:40,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:26 [2018-01-30 00:24:40,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-01-30 00:24:40,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:24:40,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:24:40,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-01-30 00:24:40,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-01-30 00:24:40,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:24:40,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-30 00:24:40,835 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:40,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:24:40,844 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-01-30 00:24:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:40,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:24:40,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-30 00:24:40,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:24:40,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:24:40,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:24:40,905 INFO L87 Difference]: Start difference. First operand 212 states and 230 transitions. Second operand 21 states. [2018-01-30 00:24:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:41,731 INFO L93 Difference]: Finished difference Result 310 states and 330 transitions. [2018-01-30 00:24:41,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:24:41,732 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-01-30 00:24:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:41,733 INFO L225 Difference]: With dead ends: 310 [2018-01-30 00:24:41,733 INFO L226 Difference]: Without dead ends: 309 [2018-01-30 00:24:41,734 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=1167, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:24:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-30 00:24:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 240. [2018-01-30 00:24:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-30 00:24:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 263 transitions. [2018-01-30 00:24:41,755 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 263 transitions. Word has length 42 [2018-01-30 00:24:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:41,756 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 263 transitions. [2018-01-30 00:24:41,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:24:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 263 transitions. [2018-01-30 00:24:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:24:41,757 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:41,757 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:24:41,757 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:41,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1282423573, now seen corresponding path program 1 times [2018-01-30 00:24:41,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:41,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:41,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:41,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:41,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:41,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:41,978 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:24:41,978 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:24:41,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:42,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:24:42,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:24:42,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:42,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:42,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-30 00:24:42,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-30 00:24:42,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:42,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:42,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:42,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:42,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-01-30 00:24:42,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:42,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-01-30 00:24:42,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 00:24:42,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:42,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-30 00:24:42,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-30 00:24:42,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:28 [2018-01-30 00:24:42,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-30 00:24:42,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:24:42,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-01-30 00:24:42,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:24:42,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:24:42,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-01-30 00:24:42,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-01-30 00:24:42,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:24:42,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-01-30 00:24:42,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-30 00:24:42,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:24:42,367 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:24:42,371 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:42,375 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-01-30 00:24:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:42,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:24:42,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-01-30 00:24:42,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 00:24:42,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 00:24:42,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:24:42,406 INFO L87 Difference]: Start difference. First operand 240 states and 263 transitions. Second operand 18 states. [2018-01-30 00:24:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:43,254 INFO L93 Difference]: Finished difference Result 322 states and 344 transitions. [2018-01-30 00:24:43,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:24:43,254 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-01-30 00:24:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:43,256 INFO L225 Difference]: With dead ends: 322 [2018-01-30 00:24:43,256 INFO L226 Difference]: Without dead ends: 316 [2018-01-30 00:24:43,256 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2018-01-30 00:24:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-01-30 00:24:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 253. [2018-01-30 00:24:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-01-30 00:24:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 277 transitions. [2018-01-30 00:24:43,269 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 277 transitions. Word has length 42 [2018-01-30 00:24:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:43,269 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 277 transitions. [2018-01-30 00:24:43,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 00:24:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 277 transitions. [2018-01-30 00:24:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:24:43,270 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:43,270 INFO L350 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, 1] [2018-01-30 00:24:43,270 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:43,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1598385953, now seen corresponding path program 1 times [2018-01-30 00:24:43,270 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:43,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:43,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:43,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:43,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:43,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:43,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:43,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:24:43,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:24:43,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:24:43,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:24:43,365 INFO L87 Difference]: Start difference. First operand 253 states and 277 transitions. Second operand 5 states. [2018-01-30 00:24:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:43,463 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2018-01-30 00:24:43,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:24:43,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-01-30 00:24:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:43,464 INFO L225 Difference]: With dead ends: 275 [2018-01-30 00:24:43,464 INFO L226 Difference]: Without dead ends: 272 [2018-01-30 00:24:43,465 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:24:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-30 00:24:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 240. [2018-01-30 00:24:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-30 00:24:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 259 transitions. [2018-01-30 00:24:43,484 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 259 transitions. Word has length 45 [2018-01-30 00:24:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:43,484 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 259 transitions. [2018-01-30 00:24:43,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:24:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 259 transitions. [2018-01-30 00:24:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:24:43,485 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:43,485 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:24:43,485 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:43,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2122700765, now seen corresponding path program 1 times [2018-01-30 00:24:43,486 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:43,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:43,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:43,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:43,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:43,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 00:24:43,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:43,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:24:43,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:24:43,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:24:43,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:24:43,568 INFO L87 Difference]: Start difference. First operand 240 states and 259 transitions. Second operand 8 states. [2018-01-30 00:24:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:43,806 INFO L93 Difference]: Finished difference Result 300 states and 320 transitions. [2018-01-30 00:24:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:24:43,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-30 00:24:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:43,807 INFO L225 Difference]: With dead ends: 300 [2018-01-30 00:24:43,808 INFO L226 Difference]: Without dead ends: 279 [2018-01-30 00:24:43,808 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:24:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-01-30 00:24:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 240. [2018-01-30 00:24:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-30 00:24:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 257 transitions. [2018-01-30 00:24:43,827 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 257 transitions. Word has length 45 [2018-01-30 00:24:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:43,827 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 257 transitions. [2018-01-30 00:24:43,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:24:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 257 transitions. [2018-01-30 00:24:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 00:24:43,828 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:43,828 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:24:43,828 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:43,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1596211252, now seen corresponding path program 1 times [2018-01-30 00:24:43,828 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:43,829 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:43,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:43,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:43,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:43,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:43,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:24:43,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:24:43,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:44,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:24:44,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-30 00:24:44,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-01-30 00:24:44,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:44,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:44,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-30 00:24:44,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:24:44,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:44,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:44,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:44,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-01-30 00:24:44,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:44,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:44,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:44,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:44,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:44,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:24:44,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:44,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:44,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:44,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-01-30 00:24:44,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-30 00:24:44,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:44,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:24:44,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:24:44,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-30 00:24:44,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:24:44,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:24:44,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:24:44,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:24:44,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:18 [2018-01-30 00:24:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:24:44,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:24:44,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 21 [2018-01-30 00:24:44,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:24:44,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:24:44,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:24:44,457 INFO L87 Difference]: Start difference. First operand 240 states and 257 transitions. Second operand 21 states. [2018-01-30 00:24:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:45,409 INFO L93 Difference]: Finished difference Result 304 states and 323 transitions. [2018-01-30 00:24:45,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:24:45,449 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-01-30 00:24:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:45,450 INFO L225 Difference]: With dead ends: 304 [2018-01-30 00:24:45,451 INFO L226 Difference]: Without dead ends: 291 [2018-01-30 00:24:45,451 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=347, Invalid=1723, Unknown=0, NotChecked=0, Total=2070 [2018-01-30 00:24:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-30 00:24:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 256. [2018-01-30 00:24:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-30 00:24:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 274 transitions. [2018-01-30 00:24:45,466 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 274 transitions. Word has length 52 [2018-01-30 00:24:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:45,466 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 274 transitions. [2018-01-30 00:24:45,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:24:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 274 transitions. [2018-01-30 00:24:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 00:24:45,467 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:45,467 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:24:45,467 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:24:45,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1596212790, now seen corresponding path program 1 times [2018-01-30 00:24:45,467 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:45,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:45,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:45,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:45,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:24:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:24:45,514 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:24:45,542 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-30 00:24:45,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:24:45 BoogieIcfgContainer [2018-01-30 00:24:45,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:24:45,569 INFO L168 Benchmark]: Toolchain (without parser) took 19218.51 ms. Allocated memory was 308.8 MB in the beginning and 620.8 MB in the end (delta: 312.0 MB). Free memory was 268.8 MB in the beginning and 328.2 MB in the end (delta: -59.4 MB). Peak memory consumption was 252.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:24:45,571 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:24:45,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.68 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 255.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:24:45,571 INFO L168 Benchmark]: Boogie Preprocessor took 38.90 ms. Allocated memory is still 308.8 MB. Free memory was 255.6 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:24:45,571 INFO L168 Benchmark]: RCFGBuilder took 519.91 ms. Allocated memory is still 308.8 MB. Free memory was 253.7 MB in the beginning and 220.9 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:24:45,572 INFO L168 Benchmark]: TraceAbstraction took 18436.42 ms. Allocated memory was 308.8 MB in the beginning and 620.8 MB in the end (delta: 312.0 MB). Free memory was 220.9 MB in the beginning and 328.2 MB in the end (delta: -107.3 MB). Peak memory consumption was 204.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:24:45,573 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.68 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 255.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.90 ms. Allocated memory is still 308.8 MB. Free memory was 255.6 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 519.91 ms. Allocated memory is still 308.8 MB. Free memory was 253.7 MB in the beginning and 220.9 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 18436.42 ms. Allocated memory was 308.8 MB in the beginning and 620.8 MB in the end (delta: 312.0 MB). Free memory was 220.9 MB in the beginning and 328.2 MB in the end (delta: -107.3 MB). Peak memory consumption was 204.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L988] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}] [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L989] FCALL head->next = ((void*)0) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L990] FCALL head->data = 0 VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L992] SLL* x = head; VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}] [L1014] x = head VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}] [L1015] FCALL x->next VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->next={0:0}] [L1015] COND FALSE !(x->next) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->next={0:0}] [L1022] EXPR, FCALL x->next VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->next={0:0}] [L1022] SLL* y = x->next; VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->next={0:0}, y={0:0}] [L1023] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, y={0:0}] [L1023] FCALL x->next = malloc(sizeof(SLL)) VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, y={0:0}] [L1024] FCALL x->data = 1 VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, y={0:0}] [L1025] FCALL x->next = y VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, y={0:0}] [L1029] x = head VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, y={0:0}] [L1032] EXPR, FCALL x->data VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->data=1, y={0:0}] [L1032] COND FALSE !(x->data != 1) VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->data=1, y={0:0}] [L1038] EXPR, FCALL x->next VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->next={0:0}, y={0:0}] [L1038] x = x->next VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={0:0}, x->next={0:0}, y={0:0}] [L1039] COND FALSE !(\read(*x)) VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={0:0}, y={0:0}] [L1047] x = head VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, y={0:0}] [L1048] COND TRUE x != ((void*)0) VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, y={0:0}] [L1050] head = x VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, y={0:0}] [L1051] EXPR, FCALL x->next VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->next={0:0}, y={0:0}] [L1051] x = x->next VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={0:0}, x->next={0:0}, y={0:0}] [L1052] FCALL free(head) VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={0:0}, y={0:0}] [L1048] COND FALSE !(x != ((void*)0)) VAL [head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={0:0}, y={0:0}] [L1055] return 0; VAL [\result=0, head={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 43 error locations. UNSAFE Result, 18.3s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2307 SDtfs, 7364 SDslu, 8604 SDs, 0 SdLazy, 8469 SolverSat, 890 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 613 GetRequests, 230 SyntacticMatches, 31 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 1178 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 968 ConstructedInterpolants, 44 QuantifiedInterpolants, 329962 SizeOfPredicates, 95 NumberOfNonLiveVariables, 907 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 25/61 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-24-45-580.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-24-45-580.csv Received shutdown request...