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.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:55:00,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:55:00,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:55:00,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:55:00,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:55:00,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:55:00,390 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:55:00,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:55:00,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:55:00,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:55:00,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:55:00,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:55:00,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:55:00,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:55:00,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:55:00,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:55:00,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:55:00,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:55:00,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:55:00,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:55:00,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:55:00,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:55:00,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:55:00,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:55:00,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:55:00,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:55:00,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:55:00,413 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:55:00,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:55:00,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:55:00,414 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:55:00,415 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.epf [2018-01-24 11:55:00,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:55:00,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:55:00,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:55:00,426 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:55:00,426 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:55:00,426 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:55:00,426 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:55:00,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:55:00,427 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:55:00,427 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:55:00,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:55:00,428 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:55:00,428 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:55:00,428 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:55:00,428 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:55:00,429 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:55:00,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:55:00,429 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:55:00,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:55:00,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:55:00,430 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:55:00,430 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:55:00,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:55:00,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:55:00,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:55:00,431 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:55:00,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:55:00,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:55:00,431 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:55:00,431 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:55:00,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:55:00,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:55:00,433 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:55:00,433 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:55:00,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:55:00,481 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:55:00,486 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:55:00,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:55:00,488 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:55:00,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-01-24 11:55:00,767 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:55:00,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:55:00,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:55:00,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:55:00,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:55:00,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:55:00" (1/1) ... [2018-01-24 11:55:00,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00, skipping insertion in model container [2018-01-24 11:55:00,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:55:00" (1/1) ... [2018-01-24 11:55:00,796 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:55:00,836 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:55:00,964 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:55:00,984 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:55:00,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00 WrapperNode [2018-01-24 11:55:00,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:55:00,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:55:00,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:55:00,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:55:01,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00" (1/1) ... [2018-01-24 11:55:01,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00" (1/1) ... [2018-01-24 11:55:01,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00" (1/1) ... [2018-01-24 11:55:01,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00" (1/1) ... [2018-01-24 11:55:01,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00" (1/1) ... [2018-01-24 11:55:01,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00" (1/1) ... [2018-01-24 11:55:01,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00" (1/1) ... [2018-01-24 11:55:01,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:55:01,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:55:01,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:55:01,038 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:55:01,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00" (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-24 11:55:01,088 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:55:01,089 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:55:01,089 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 11:55:01,089 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 11:55:01,089 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:55:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:55:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:55:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 11:55:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 11:55:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:55:01,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:55:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:55:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 11:55:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 11:55:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:55:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 11:55:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 11:55:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:55:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:55:01,090 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:55:01,419 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:55:01,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:55:01 BoogieIcfgContainer [2018-01-24 11:55:01,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:55:01,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:55:01,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:55:01,422 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:55:01,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:55:00" (1/3) ... [2018-01-24 11:55:01,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:55:01, skipping insertion in model container [2018-01-24 11:55:01,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:00" (2/3) ... [2018-01-24 11:55:01,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:55:01, skipping insertion in model container [2018-01-24 11:55:01,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:55:01" (3/3) ... [2018-01-24 11:55:01,426 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-01-24 11:55:01,436 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:55:01,445 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 11:55:01,492 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:55:01,492 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:55:01,492 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:55:01,492 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:55:01,492 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:55:01,493 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:55:01,493 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:55:01,493 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:55:01,494 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:55:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 11:55:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 11:55:01,522 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:01,523 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:01,524 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 11:55:01,531 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:01,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:01,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:01,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:01,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:01,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:01,704 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-24 11:55:01,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:01,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:55:01,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 11:55:01,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 11:55:01,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 11:55:01,731 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 11:55:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:01,870 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 11:55:01,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 11:55:01,872 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 11:55:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:01,885 INFO L225 Difference]: With dead ends: 92 [2018-01-24 11:55:01,886 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 11:55:01,890 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 11:55:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 11:55:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 11:55:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 11:55:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 11:55:01,928 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 11:55:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:01,928 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 11:55:01,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 11:55:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 11:55:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 11:55:01,929 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:01,929 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:01,929 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 11:55:01,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:01,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:01,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:01,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:01,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:01,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:02,004 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-24 11:55:02,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:02,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:55:02,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:55:02,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:55:02,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:02,008 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 11:55:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:02,028 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 11:55:02,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:55:02,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 11:55:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:02,029 INFO L225 Difference]: With dead ends: 87 [2018-01-24 11:55:02,029 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 11:55:02,030 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 11:55:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 11:55:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 11:55:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 11:55:02,037 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 11:55:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:02,038 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 11:55:02,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:55:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 11:55:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 11:55:02,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:02,039 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:02,039 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:02,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 11:55:02,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:02,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:02,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:02,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:02,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:02,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:02,208 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-24 11:55:02,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:02,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:55:02,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:55:02,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:55:02,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:02,210 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 11:55:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:02,379 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 11:55:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:55:02,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 11:55:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:02,383 INFO L225 Difference]: With dead ends: 145 [2018-01-24 11:55:02,383 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 11:55:02,383 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 11:55:02,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 11:55:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 11:55:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 11:55:02,437 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 11:55:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:02,437 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 11:55:02,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:55:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 11:55:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:55:02,438 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:02,438 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:02,438 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 11:55:02,440 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:02,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:02,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:02,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:02,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:02,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:02,558 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-24 11:55:02,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:02,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:55:02,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:55:02,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:55:02,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:02,560 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 11:55:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:02,655 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 11:55:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:55:02,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 11:55:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:02,657 INFO L225 Difference]: With dead ends: 148 [2018-01-24 11:55:02,657 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 11:55:02,658 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 11:55:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 11:55:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 11:55:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 11:55:02,671 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 11:55:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:02,672 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 11:55:02,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:55:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 11:55:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:55:02,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:02,672 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:02,672 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:02,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 11:55:02,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:02,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:02,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:02,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:02,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:02,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:02,756 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-24 11:55:02,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:02,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:55:02,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:55:02,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:55:02,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:55:02,757 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 11:55:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:02,915 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 11:55:02,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:55:02,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 11:55:02,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:02,918 INFO L225 Difference]: With dead ends: 385 [2018-01-24 11:55:02,919 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 11:55:02,921 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:55:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 11:55:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 11:55:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 11:55:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 11:55:02,950 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 11:55:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:02,951 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 11:55:02,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:55:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 11:55:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:55:02,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:02,952 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:02,953 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:02,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 11:55:02,953 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:02,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:02,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:02,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:02,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:02,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:03,008 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-24 11:55:03,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:03,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:55:03,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:55:03,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:55:03,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:55:03,009 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 11:55:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:03,152 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-24 11:55:03,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:55:03,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 11:55:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:03,156 INFO L225 Difference]: With dead ends: 390 [2018-01-24 11:55:03,156 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 11:55:03,157 INFO L525 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-24 11:55:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 11:55:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-24 11:55:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 11:55:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 11:55:03,193 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 11:55:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:03,194 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 11:55:03,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:55:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 11:55:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:55:03,195 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:03,195 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:03,196 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:03,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 11:55:03,196 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:03,196 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:03,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:03,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:03,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:03,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:03,271 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-24 11:55:03,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:03,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:55:03,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:55:03,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:55:03,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:55:03,273 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 11:55:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:03,397 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-24 11:55:03,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:55:03,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 11:55:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:03,402 INFO L225 Difference]: With dead ends: 489 [2018-01-24 11:55:03,403 INFO L226 Difference]: Without dead ends: 485 [2018-01-24 11:55:03,403 INFO L525 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-24 11:55:03,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-24 11:55:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-24 11:55:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 11:55:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 11:55:03,439 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 11:55:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:03,440 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 11:55:03,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:55:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 11:55:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:55:03,441 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:03,441 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:03,441 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:03,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 11:55:03,442 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:03,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:03,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:03,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:03,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:03,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:03,542 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-24 11:55:03,542 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:03,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:55:03,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:55:03,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:55:03,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:55:03,544 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 11:55:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:03,659 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 11:55:03,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:55:03,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 11:55:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:03,666 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 11:55:03,666 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 11:55:03,669 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:55:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 11:55:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 11:55:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 11:55:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 11:55:03,728 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 11:55:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:03,729 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 11:55:03,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:55:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 11:55:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:55:03,730 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:03,730 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:03,731 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 11:55:03,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:03,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:03,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:03,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:03,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:03,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:03,884 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:03,884 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-24 11:55:03,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:03,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:04,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:04,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-01-24 11:55:04,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:55:04,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:55:04,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:55:04,112 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-01-24 11:55:04,702 WARN L143 SmtUtils]: Spent 169ms on a formula simplification that was a NOOP. DAG size: 13 [2018-01-24 11:55:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:05,786 INFO L93 Difference]: Finished difference Result 2243 states and 3305 transitions. [2018-01-24 11:55:05,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:55:05,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 11:55:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:05,797 INFO L225 Difference]: With dead ends: 2243 [2018-01-24 11:55:05,797 INFO L226 Difference]: Without dead ends: 1420 [2018-01-24 11:55:05,801 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:55:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-01-24 11:55:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-01-24 11:55:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-01-24 11:55:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-01-24 11:55:05,903 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-01-24 11:55:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:05,903 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-01-24 11:55:05,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:55:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-01-24 11:55:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:55:05,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:05,905 INFO L322 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] [2018-01-24 11:55:05,905 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-01-24 11:55:05,906 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:05,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:05,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:05,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:05,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:05,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:06,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:06,128 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-24 11:55:06,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:06,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:06,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:55:06,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-01-24 11:55:06,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:55:06,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:55:06,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:55:06,276 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 11 states. [2018-01-24 11:55:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:08,675 INFO L93 Difference]: Finished difference Result 4161 states and 6508 transitions. [2018-01-24 11:55:08,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 11:55:08,676 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-24 11:55:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:08,699 INFO L225 Difference]: With dead ends: 4161 [2018-01-24 11:55:08,700 INFO L226 Difference]: Without dead ends: 2898 [2018-01-24 11:55:08,706 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 11:55:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2018-01-24 11:55:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2348. [2018-01-24 11:55:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2018-01-24 11:55:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3475 transitions. [2018-01-24 11:55:08,911 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3475 transitions. Word has length 27 [2018-01-24 11:55:08,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:08,912 INFO L432 AbstractCegarLoop]: Abstraction has 2348 states and 3475 transitions. [2018-01-24 11:55:08,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:55:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3475 transitions. [2018-01-24 11:55:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 11:55:08,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:08,914 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:08,914 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-01-24 11:55:08,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:08,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:08,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:08,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:08,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:08,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:09,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:09,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:55:09,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:55:09,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:55:09,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:55:09,142 INFO L87 Difference]: Start difference. First operand 2348 states and 3475 transitions. Second operand 7 states. [2018-01-24 11:55:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:10,735 INFO L93 Difference]: Finished difference Result 3428 states and 4851 transitions. [2018-01-24 11:55:10,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:55:10,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 11:55:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:10,745 INFO L225 Difference]: With dead ends: 3428 [2018-01-24 11:55:10,745 INFO L226 Difference]: Without dead ends: 869 [2018-01-24 11:55:10,758 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:55:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-01-24 11:55:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 772. [2018-01-24 11:55:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-01-24 11:55:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1012 transitions. [2018-01-24 11:55:10,838 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1012 transitions. Word has length 31 [2018-01-24 11:55:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:10,839 INFO L432 AbstractCegarLoop]: Abstraction has 772 states and 1012 transitions. [2018-01-24 11:55:10,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:55:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1012 transitions. [2018-01-24 11:55:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 11:55:10,841 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:10,841 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:10,841 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:10,842 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-01-24 11:55:10,842 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:10,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:10,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:10,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:10,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:10,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:10,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:10,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-24 11:55:11,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:11,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 11:55:11,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:55:11,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-01-24 11:55:11,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:55:11,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:55:11,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:55:11,118 INFO L87 Difference]: Start difference. First operand 772 states and 1012 transitions. Second operand 10 states. [2018-01-24 11:55:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:12,031 INFO L93 Difference]: Finished difference Result 3377 states and 4584 transitions. [2018-01-24 11:55:12,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:55:12,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-24 11:55:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:12,043 INFO L225 Difference]: With dead ends: 3377 [2018-01-24 11:55:12,043 INFO L226 Difference]: Without dead ends: 2610 [2018-01-24 11:55:12,046 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:55:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2018-01-24 11:55:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2263. [2018-01-24 11:55:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-01-24 11:55:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2989 transitions. [2018-01-24 11:55:12,217 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2989 transitions. Word has length 38 [2018-01-24 11:55:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:12,217 INFO L432 AbstractCegarLoop]: Abstraction has 2263 states and 2989 transitions. [2018-01-24 11:55:12,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:55:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2989 transitions. [2018-01-24 11:55:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 11:55:12,220 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:12,220 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:12,220 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:12,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1056748287, now seen corresponding path program 1 times [2018-01-24 11:55:12,220 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:12,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:12,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:12,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:12,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:12,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 11:55:12,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:12,445 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-24 11:55:12,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:12,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 11:55:12,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:12,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-01-24 11:55:12,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 11:55:12,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 11:55:12,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:55:12,656 INFO L87 Difference]: Start difference. First operand 2263 states and 2989 transitions. Second operand 16 states. [2018-01-24 11:55:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:13,643 INFO L93 Difference]: Finished difference Result 4568 states and 6003 transitions. [2018-01-24 11:55:13,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 11:55:13,644 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-01-24 11:55:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:13,652 INFO L225 Difference]: With dead ends: 4568 [2018-01-24 11:55:13,652 INFO L226 Difference]: Without dead ends: 2259 [2018-01-24 11:55:13,656 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=341, Invalid=1465, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 11:55:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2018-01-24 11:55:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1656. [2018-01-24 11:55:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-01-24 11:55:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2081 transitions. [2018-01-24 11:55:13,739 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2081 transitions. Word has length 41 [2018-01-24 11:55:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:13,739 INFO L432 AbstractCegarLoop]: Abstraction has 1656 states and 2081 transitions. [2018-01-24 11:55:13,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 11:55:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2081 transitions. [2018-01-24 11:55:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 11:55:13,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:13,740 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:13,740 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-01-24 11:55:13,741 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:13,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:13,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:13,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:13,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:13,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 11:55:13,978 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:13,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-24 11:55:13,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:14,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:14,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:14,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-01-24 11:55:14,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 11:55:14,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 11:55:14,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:55:14,297 INFO L87 Difference]: Start difference. First operand 1656 states and 2081 transitions. Second operand 14 states. [2018-01-24 11:55:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:15,133 INFO L93 Difference]: Finished difference Result 3938 states and 5049 transitions. [2018-01-24 11:55:15,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-24 11:55:15,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-01-24 11:55:15,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:15,141 INFO L225 Difference]: With dead ends: 3938 [2018-01-24 11:55:15,141 INFO L226 Difference]: Without dead ends: 2319 [2018-01-24 11:55:15,146 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 11:55:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2018-01-24 11:55:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2095. [2018-01-24 11:55:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2095 states. [2018-01-24 11:55:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 2656 transitions. [2018-01-24 11:55:15,319 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 2656 transitions. Word has length 42 [2018-01-24 11:55:15,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:15,320 INFO L432 AbstractCegarLoop]: Abstraction has 2095 states and 2656 transitions. [2018-01-24 11:55:15,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 11:55:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2656 transitions. [2018-01-24 11:55:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 11:55:15,321 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:15,321 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-01-24 11:55:15,322 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-01-24 11:55:15,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:15,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:15,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:15,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:15,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:15,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 11:55:15,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:15,493 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-24 11:55:15,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:15,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 11:55:15,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:15,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-24 11:55:15,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:55:15,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:55:15,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:55:15,709 INFO L87 Difference]: Start difference. First operand 2095 states and 2656 transitions. Second operand 11 states. [2018-01-24 11:55:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:16,102 INFO L93 Difference]: Finished difference Result 4832 states and 6313 transitions. [2018-01-24 11:55:16,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:55:16,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-01-24 11:55:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:16,116 INFO L225 Difference]: With dead ends: 4832 [2018-01-24 11:55:16,116 INFO L226 Difference]: Without dead ends: 2774 [2018-01-24 11:55:16,122 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:55:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2018-01-24 11:55:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2161. [2018-01-24 11:55:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2161 states. [2018-01-24 11:55:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2755 transitions. [2018-01-24 11:55:16,307 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2755 transitions. Word has length 54 [2018-01-24 11:55:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:16,307 INFO L432 AbstractCegarLoop]: Abstraction has 2161 states and 2755 transitions. [2018-01-24 11:55:16,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:55:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2755 transitions. [2018-01-24 11:55:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 11:55:16,309 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:16,309 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:16,309 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-01-24 11:55:16,310 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:16,310 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:16,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:16,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:16,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:16,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 11:55:16,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:16,483 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:55:16,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:16,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 11:55:16,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:16,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-01-24 11:55:16,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:55:16,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:55:16,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:55:16,673 INFO L87 Difference]: Start difference. First operand 2161 states and 2755 transitions. Second operand 15 states. [2018-01-24 11:55:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:17,449 INFO L93 Difference]: Finished difference Result 5811 states and 7782 transitions. [2018-01-24 11:55:17,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:55:17,450 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-01-24 11:55:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:17,465 INFO L225 Difference]: With dead ends: 5811 [2018-01-24 11:55:17,465 INFO L226 Difference]: Without dead ends: 3615 [2018-01-24 11:55:17,471 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 11:55:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2018-01-24 11:55:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 2996. [2018-01-24 11:55:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2996 states. [2018-01-24 11:55:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 3855 transitions. [2018-01-24 11:55:17,710 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 3855 transitions. Word has length 54 [2018-01-24 11:55:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:17,710 INFO L432 AbstractCegarLoop]: Abstraction has 2996 states and 3855 transitions. [2018-01-24 11:55:17,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:55:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 3855 transitions. [2018-01-24 11:55:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 11:55:17,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:17,713 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-01-24 11:55:17,713 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-01-24 11:55:17,713 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:17,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:17,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:17,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:17,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:17,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-24 11:55:17,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:17,838 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:55:17,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:17,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-24 11:55:17,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:17,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-24 11:55:17,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:55:17,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:55:17,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:55:17,958 INFO L87 Difference]: Start difference. First operand 2996 states and 3855 transitions. Second operand 11 states. [2018-01-24 11:55:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:18,427 INFO L93 Difference]: Finished difference Result 6568 states and 8612 transitions. [2018-01-24 11:55:18,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:55:18,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-01-24 11:55:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:18,445 INFO L225 Difference]: With dead ends: 6568 [2018-01-24 11:55:18,445 INFO L226 Difference]: Without dead ends: 3609 [2018-01-24 11:55:18,453 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:55:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2018-01-24 11:55:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3567. [2018-01-24 11:55:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2018-01-24 11:55:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 4691 transitions. [2018-01-24 11:55:18,708 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 4691 transitions. Word has length 68 [2018-01-24 11:55:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:18,709 INFO L432 AbstractCegarLoop]: Abstraction has 3567 states and 4691 transitions. [2018-01-24 11:55:18,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:55:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4691 transitions. [2018-01-24 11:55:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 11:55:18,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:18,710 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-01-24 11:55:18,711 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-01-24 11:55:18,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:18,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:18,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:18,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:18,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:18,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 11:55:18,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:18,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:55:18,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:19,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 11:55:19,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:19,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-01-24 11:55:19,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 11:55:19,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 11:55:19,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-01-24 11:55:19,200 INFO L87 Difference]: Start difference. First operand 3567 states and 4691 transitions. Second operand 18 states. [2018-01-24 11:55:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:20,447 INFO L93 Difference]: Finished difference Result 9785 states and 13354 transitions. [2018-01-24 11:55:20,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 11:55:20,447 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-01-24 11:55:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:20,466 INFO L225 Difference]: With dead ends: 9785 [2018-01-24 11:55:20,467 INFO L226 Difference]: Without dead ends: 6156 [2018-01-24 11:55:20,474 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 11:55:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6156 states. [2018-01-24 11:55:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6156 to 4675. [2018-01-24 11:55:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4675 states. [2018-01-24 11:55:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4675 states to 4675 states and 6031 transitions. [2018-01-24 11:55:20,767 INFO L78 Accepts]: Start accepts. Automaton has 4675 states and 6031 transitions. Word has length 70 [2018-01-24 11:55:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:20,767 INFO L432 AbstractCegarLoop]: Abstraction has 4675 states and 6031 transitions. [2018-01-24 11:55:20,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 11:55:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4675 states and 6031 transitions. [2018-01-24 11:55:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 11:55:20,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:20,769 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:20,769 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-01-24 11:55:20,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:20,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:20,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:20,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:20,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:20,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-24 11:55:20,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:20,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:55:20,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:21,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-24 11:55:21,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:21,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-01-24 11:55:21,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:55:21,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:55:21,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:55:21,194 INFO L87 Difference]: Start difference. First operand 4675 states and 6031 transitions. Second operand 17 states. [2018-01-24 11:55:22,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:22,311 INFO L93 Difference]: Finished difference Result 10780 states and 14334 transitions. [2018-01-24 11:55:22,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 11:55:22,311 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-01-24 11:55:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:22,328 INFO L225 Difference]: With dead ends: 10780 [2018-01-24 11:55:22,328 INFO L226 Difference]: Without dead ends: 6004 [2018-01-24 11:55:22,338 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 11:55:22,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2018-01-24 11:55:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 4579. [2018-01-24 11:55:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2018-01-24 11:55:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 5837 transitions. [2018-01-24 11:55:22,622 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 5837 transitions. Word has length 84 [2018-01-24 11:55:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:22,622 INFO L432 AbstractCegarLoop]: Abstraction has 4579 states and 5837 transitions. [2018-01-24 11:55:22,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:55:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 5837 transitions. [2018-01-24 11:55:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-24 11:55:22,624 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:22,624 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:22,624 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-01-24 11:55:22,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:22,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:22,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:22,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:22,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:22,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-24 11:55:22,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:22,961 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:55:22,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:23,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 11:55:23,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:23,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-01-24 11:55:23,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 11:55:23,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 11:55:23,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-01-24 11:55:23,148 INFO L87 Difference]: Start difference. First operand 4579 states and 5837 transitions. Second operand 18 states. [2018-01-24 11:55:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:24,532 INFO L93 Difference]: Finished difference Result 11072 states and 14380 transitions. [2018-01-24 11:55:24,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 11:55:24,533 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-01-24 11:55:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:24,550 INFO L225 Difference]: With dead ends: 11072 [2018-01-24 11:55:24,551 INFO L226 Difference]: Without dead ends: 6515 [2018-01-24 11:55:24,560 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 11:55:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6515 states. [2018-01-24 11:55:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6515 to 6365. [2018-01-24 11:55:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6365 states. [2018-01-24 11:55:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6365 states to 6365 states and 8191 transitions. [2018-01-24 11:55:25,190 INFO L78 Accepts]: Start accepts. Automaton has 6365 states and 8191 transitions. Word has length 87 [2018-01-24 11:55:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:25,190 INFO L432 AbstractCegarLoop]: Abstraction has 6365 states and 8191 transitions. [2018-01-24 11:55:25,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 11:55:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 6365 states and 8191 transitions. [2018-01-24 11:55:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-24 11:55:25,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:25,192 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 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] [2018-01-24 11:55:25,192 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:55:25,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1756447406, now seen corresponding path program 1 times [2018-01-24 11:55:25,193 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:25,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:25,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:25,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:25,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 11:55:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 11:55:25,279 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 11:55:25,339 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 11:55:25,349 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,350 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,351 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,352 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,353 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,356 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,357 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,360 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,362 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,363 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,365 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,366 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,368 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:55:25,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:55:25 BoogieIcfgContainer [2018-01-24 11:55:25,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:55:25,388 INFO L168 Benchmark]: Toolchain (without parser) took 24620.53 ms. Allocated memory was 295.2 MB in the beginning and 761.3 MB in the end (delta: 466.1 MB). Free memory was 255.2 MB in the beginning and 432.3 MB in the end (delta: -177.1 MB). Peak memory consumption was 289.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:55:25,389 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 295.2 MB. Free memory is still 261.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:55:25,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.81 ms. Allocated memory is still 295.2 MB. Free memory was 254.2 MB in the beginning and 243.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:55:25,389 INFO L168 Benchmark]: Boogie Preprocessor took 43.43 ms. Allocated memory is still 295.2 MB. Free memory was 243.2 MB in the beginning and 241.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:55:25,389 INFO L168 Benchmark]: RCFGBuilder took 382.59 ms. Allocated memory is still 295.2 MB. Free memory was 241.2 MB in the beginning and 215.6 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-24 11:55:25,390 INFO L168 Benchmark]: TraceAbstraction took 23966.47 ms. Allocated memory was 295.2 MB in the beginning and 761.3 MB in the end (delta: 466.1 MB). Free memory was 215.6 MB in the beginning and 432.3 MB in the end (delta: -216.7 MB). Peak memory consumption was 249.4 MB. Max. memory is 5.3 GB. [2018-01-24 11:55:25,391 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.20 ms. Allocated memory is still 295.2 MB. Free memory is still 261.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.81 ms. Allocated memory is still 295.2 MB. Free memory was 254.2 MB in the beginning and 243.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.43 ms. Allocated memory is still 295.2 MB. Free memory was 243.2 MB in the beginning and 241.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 382.59 ms. Allocated memory is still 295.2 MB. Free memory was 241.2 MB in the beginning and 215.6 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 23966.47 ms. Allocated memory was 295.2 MB in the beginning and 761.3 MB in the end (delta: 466.1 MB). Free memory was 215.6 MB in the beginning and 432.3 MB in the end (delta: -216.7 MB). Peak memory consumption was 249.4 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L638] RET, FCALL x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L652] case 6: [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. UNSAFE Result, 23.9s OverallTime, 21 OverallIterations, 7 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1975 SDtfs, 5489 SDslu, 4187 SDs, 0 SdLazy, 6428 SolverSat, 1332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1009 GetRequests, 659 SyntacticMatches, 6 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6365occurred in iteration=20, 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, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 6444 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1417 NumberOfCodeBlocks, 1417 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1291 ConstructedInterpolants, 0 QuantifiedInterpolants, 184901 SizeOfPredicates, 45 NumberOfNonLiveVariables, 4705 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 1042/1239 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-55-25-399.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-55-25-399.csv Received shutdown request...