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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:37:05,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:37:05,943 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:37:05,954 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:37:05,954 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:37:05,955 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:37:05,956 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:37:05,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:37:05,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:37:05,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:37:05,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:37:05,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:37:05,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:37:05,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:37:05,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:37:05,964 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:37:05,966 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:37:05,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:37:05,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:37:05,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:37:05,971 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:37:05,971 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:37:05,971 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:37:05,972 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:37:05,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:37:05,973 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:37:05,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:37:05,974 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:37:05,974 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:37:05,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:37:05,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:37:05,975 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:37:05,985 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:37:05,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:37:05,986 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:37:05,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:37:05,986 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:37:05,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:37:05,987 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:37:05,987 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:37:05,987 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:37:05,987 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:37:05,987 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:37:05,988 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:37:05,988 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:37:05,988 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:37:05,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:37:05,988 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:37:05,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:37:05,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:37:05,989 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:37:05,989 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:37:05,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:37:05,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:37:05,989 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:37:05,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:37:05,989 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:37:06,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:37:06,031 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:37:06,034 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:37:06,035 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:37:06,036 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:37:06,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-02-02 18:37:06,185 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:37:06,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:37:06,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:37:06,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:37:06,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:37:06,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:37:06" (1/1) ... [2018-02-02 18:37:06,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ebe4d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06, skipping insertion in model container [2018-02-02 18:37:06,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:37:06" (1/1) ... [2018-02-02 18:37:06,214 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:37:06,246 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:37:06,339 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:37:06,353 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:37:06,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06 WrapperNode [2018-02-02 18:37:06,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:37:06,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:37:06,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:37:06,359 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:37:06,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06" (1/1) ... [2018-02-02 18:37:06,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06" (1/1) ... [2018-02-02 18:37:06,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06" (1/1) ... [2018-02-02 18:37:06,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06" (1/1) ... [2018-02-02 18:37:06,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06" (1/1) ... [2018-02-02 18:37:06,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06" (1/1) ... [2018-02-02 18:37:06,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06" (1/1) ... [2018-02-02 18:37:06,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:37:06,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:37:06,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:37:06,387 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:37:06,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 18:37:06,420 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:37:06,420 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:37:06,420 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-02 18:37:06,420 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-02 18:37:06,420 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:37:06,420 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:37:06,420 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:37:06,420 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:37:06,420 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:37:06,420 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:37:06,421 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:37:06,421 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:37:06,421 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:37:06,421 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:37:06,421 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:37:06,421 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-02 18:37:06,421 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-02 18:37:06,421 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:37:06,421 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:37:06,421 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:37:06,670 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:37:06,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:37:06 BoogieIcfgContainer [2018-02-02 18:37:06,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:37:06,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:37:06,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:37:06,674 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:37:06,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:37:06" (1/3) ... [2018-02-02 18:37:06,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cabad46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:37:06, skipping insertion in model container [2018-02-02 18:37:06,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:06" (2/3) ... [2018-02-02 18:37:06,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cabad46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:37:06, skipping insertion in model container [2018-02-02 18:37:06,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:37:06" (3/3) ... [2018-02-02 18:37:06,677 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-02-02 18:37:06,684 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:37:06,690 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 18:37:06,720 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:37:06,720 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:37:06,720 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:37:06,720 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:37:06,720 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:37:06,721 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:37:06,721 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:37:06,721 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:37:06,721 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:37:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-02 18:37:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 18:37:06,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:06,742 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:06,742 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-02-02 18:37:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-02 18:37:06,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:06,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:06,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:06,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:06,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:06,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:06,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:06,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:37:06,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 18:37:06,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 18:37:06,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 18:37:06,878 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-02 18:37:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:06,961 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-02 18:37:06,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 18:37:06,962 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-02 18:37:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:06,970 INFO L225 Difference]: With dead ends: 76 [2018-02-02 18:37:06,970 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 18:37:06,971 INFO L554 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-02-02 18:37:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 18:37:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 18:37:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 18:37:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-02 18:37:06,996 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-02 18:37:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:06,996 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-02 18:37:06,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 18:37:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-02 18:37:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:37:06,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:06,996 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:06,996 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-02-02 18:37:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-02 18:37:06,997 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:06,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:06,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:06,998 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:06,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:07,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:07,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:07,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:37:07,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:37:07,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:37:07,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:07,041 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-02 18:37:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:07,054 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-02 18:37:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:37:07,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 18:37:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:07,058 INFO L225 Difference]: With dead ends: 74 [2018-02-02 18:37:07,058 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 18:37:07,059 INFO L554 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-02-02 18:37:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 18:37:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 18:37:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 18:37:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-02 18:37:07,065 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-02 18:37:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:07,065 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-02 18:37:07,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:37:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-02 18:37:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:37:07,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:07,066 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:07,066 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-02-02 18:37:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-02 18:37:07,067 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:07,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:07,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,067 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:07,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:07,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:07,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:07,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:37:07,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:37:07,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:37:07,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:07,135 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-02 18:37:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:07,157 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-02 18:37:07,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:37:07,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 18:37:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:07,159 INFO L225 Difference]: With dead ends: 132 [2018-02-02 18:37:07,159 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 18:37:07,159 INFO L554 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-02-02 18:37:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 18:37:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-02 18:37:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 18:37:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-02 18:37:07,169 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-02 18:37:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:07,169 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-02 18:37:07,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:37:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-02 18:37:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 18:37:07,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:07,170 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:07,170 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-02-02 18:37:07,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-02 18:37:07,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:07,170 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:07,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,171 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:07,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:07,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:07,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:07,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:37:07,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:37:07,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:37:07,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:07,207 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-02 18:37:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:07,257 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-02 18:37:07,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:37:07,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-02 18:37:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:07,258 INFO L225 Difference]: With dead ends: 147 [2018-02-02 18:37:07,258 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 18:37:07,258 INFO L554 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-02-02 18:37:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 18:37:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-02 18:37:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 18:37:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-02 18:37:07,268 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-02 18:37:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:07,268 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-02 18:37:07,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:37:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-02 18:37:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 18:37:07,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:07,269 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:07,269 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-02-02 18:37:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-02 18:37:07,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:07,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:07,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:07,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:07,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:07,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:07,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:37:07,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:37:07,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:37:07,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:37:07,318 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-02 18:37:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:07,385 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-02 18:37:07,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:37:07,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 18:37:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:07,388 INFO L225 Difference]: With dead ends: 255 [2018-02-02 18:37:07,389 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 18:37:07,389 INFO L554 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-02-02 18:37:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 18:37:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-02 18:37:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 18:37:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-02 18:37:07,403 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-02 18:37:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:07,403 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-02 18:37:07,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:37:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-02 18:37:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:37:07,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:07,404 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:07,404 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-02-02 18:37:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-02 18:37:07,404 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:07,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:07,405 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,405 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:07,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:07,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:07,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:07,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:37:07,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:37:07,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:37:07,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:37:07,454 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-02 18:37:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:07,533 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-02 18:37:07,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:37:07,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 18:37:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:07,536 INFO L225 Difference]: With dead ends: 386 [2018-02-02 18:37:07,536 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 18:37:07,536 INFO L554 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-02-02 18:37:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 18:37:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-02 18:37:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 18:37:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-02 18:37:07,552 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-02 18:37:07,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:07,553 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-02 18:37:07,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:37:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-02 18:37:07,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:37:07,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:07,554 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:07,554 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-02-02 18:37:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-02 18:37:07,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:07,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:07,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:07,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:07,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:07,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:07,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:37:07,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:37:07,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:37:07,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:37:07,600 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-02 18:37:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:07,692 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-02 18:37:07,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:37:07,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 18:37:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:07,695 INFO L225 Difference]: With dead ends: 485 [2018-02-02 18:37:07,695 INFO L226 Difference]: Without dead ends: 485 [2018-02-02 18:37:07,696 INFO L554 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-02-02 18:37:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-02 18:37:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-02 18:37:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-02 18:37:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-02 18:37:07,715 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-02 18:37:07,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:07,715 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-02 18:37:07,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:37:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-02 18:37:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:37:07,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:07,716 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:07,717 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-02-02 18:37:07,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-02 18:37:07,717 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:07,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:07,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,718 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:07,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:07,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:07,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:07,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:37:07,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:37:07,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:37:07,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:37:07,762 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-02 18:37:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:07,806 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-02 18:37:07,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:37:07,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 18:37:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:07,810 INFO L225 Difference]: With dead ends: 861 [2018-02-02 18:37:07,810 INFO L226 Difference]: Without dead ends: 861 [2018-02-02 18:37:07,811 INFO L554 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-02-02 18:37:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-02 18:37:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-02 18:37:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-02 18:37:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-02 18:37:07,835 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-02 18:37:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:07,835 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-02 18:37:07,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:37:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-02 18:37:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 18:37:07,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:07,836 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:07,836 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-02-02 18:37:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-02 18:37:07,837 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:07,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:07,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:07,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:07,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:07,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:07,887 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:07,895 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:07,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:08,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:08,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-02-02 18:37:08,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:37:08,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:37:08,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:37:08,028 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-02-02 18:37:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:08,338 INFO L93 Difference]: Finished difference Result 1420 states and 2030 transitions. [2018-02-02 18:37:08,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 18:37:08,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 18:37:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:08,343 INFO L225 Difference]: With dead ends: 1420 [2018-02-02 18:37:08,343 INFO L226 Difference]: Without dead ends: 1420 [2018-02-02 18:37:08,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:37:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-02-02 18:37:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-02-02 18:37:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-02-02 18:37:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-02-02 18:37:08,372 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-02-02 18:37:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:08,373 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-02-02 18:37:08,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:37:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-02-02 18:37:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:37:08,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:08,374 INFO L351 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-02-02 18:37:08,374 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-02-02 18:37:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-02 18:37:08,374 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:08,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:08,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:08,375 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:08,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:08,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:08,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:08,443 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:08,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:08,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:08,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:37:08,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-02-02 18:37:08,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:37:08,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:37:08,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:37:08,546 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 11 states. [2018-02-02 18:37:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:09,153 INFO L93 Difference]: Finished difference Result 2898 states and 4625 transitions. [2018-02-02 18:37:09,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 18:37:09,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-02 18:37:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:09,167 INFO L225 Difference]: With dead ends: 2898 [2018-02-02 18:37:09,167 INFO L226 Difference]: Without dead ends: 2898 [2018-02-02 18:37:09,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 18:37:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2018-02-02 18:37:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2348. [2018-02-02 18:37:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2018-02-02 18:37:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3475 transitions. [2018-02-02 18:37:09,251 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3475 transitions. Word has length 27 [2018-02-02 18:37:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:09,251 INFO L432 AbstractCegarLoop]: Abstraction has 2348 states and 3475 transitions. [2018-02-02 18:37:09,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:37:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3475 transitions. [2018-02-02 18:37:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 18:37:09,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:09,252 INFO L351 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-02-02 18:37:09,255 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-02-02 18:37:09,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-02 18:37:09,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:09,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:09,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:09,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:09,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:09,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:09,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:09,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:37:09,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:37:09,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:37:09,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:37:09,309 INFO L87 Difference]: Start difference. First operand 2348 states and 3475 transitions. Second operand 7 states. [2018-02-02 18:37:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:09,467 INFO L93 Difference]: Finished difference Result 1085 states and 1347 transitions. [2018-02-02 18:37:09,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:37:09,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-02 18:37:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:09,471 INFO L225 Difference]: With dead ends: 1085 [2018-02-02 18:37:09,471 INFO L226 Difference]: Without dead ends: 869 [2018-02-02 18:37:09,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:37:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-02-02 18:37:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 772. [2018-02-02 18:37:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-02-02 18:37:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1012 transitions. [2018-02-02 18:37:09,490 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1012 transitions. Word has length 31 [2018-02-02 18:37:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:09,490 INFO L432 AbstractCegarLoop]: Abstraction has 772 states and 1012 transitions. [2018-02-02 18:37:09,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:37:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1012 transitions. [2018-02-02 18:37:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:37:09,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:09,491 INFO L351 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-02-02 18:37:09,491 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-02-02 18:37:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-02 18:37:09,492 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:09,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:09,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:09,492 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:09,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:09,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:09,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:09,573 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:09,580 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:09,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 18:37:09,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:37:09,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-02-02 18:37:09,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:37:09,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:37:09,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:37:09,685 INFO L87 Difference]: Start difference. First operand 772 states and 1012 transitions. Second operand 10 states. [2018-02-02 18:37:10,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:10,315 INFO L93 Difference]: Finished difference Result 2610 states and 3504 transitions. [2018-02-02 18:37:10,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:37:10,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-02 18:37:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:10,325 INFO L225 Difference]: With dead ends: 2610 [2018-02-02 18:37:10,325 INFO L226 Difference]: Without dead ends: 2610 [2018-02-02 18:37:10,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-02-02 18:37:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2018-02-02 18:37:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2263. [2018-02-02 18:37:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-02-02 18:37:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2989 transitions. [2018-02-02 18:37:10,377 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2989 transitions. Word has length 38 [2018-02-02 18:37:10,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:10,377 INFO L432 AbstractCegarLoop]: Abstraction has 2263 states and 2989 transitions. [2018-02-02 18:37:10,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:37:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2989 transitions. [2018-02-02 18:37:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 18:37:10,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:10,378 INFO L351 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-02-02 18:37:10,378 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-02-02 18:37:10,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1056748287, now seen corresponding path program 1 times [2018-02-02 18:37:10,378 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:10,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:10,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:10,379 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:10,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:10,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:37:10,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:10,514 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:10,522 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:10,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 18:37:10,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:10,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-02-02 18:37:10,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 18:37:10,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 18:37:10,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 18:37:10,693 INFO L87 Difference]: Start difference. First operand 2263 states and 2989 transitions. Second operand 16 states. [2018-02-02 18:37:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:11,602 INFO L93 Difference]: Finished difference Result 2313 states and 2891 transitions. [2018-02-02 18:37:11,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 18:37:11,602 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-02 18:37:11,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:11,610 INFO L225 Difference]: With dead ends: 2313 [2018-02-02 18:37:11,610 INFO L226 Difference]: Without dead ends: 2259 [2018-02-02 18:37:11,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=341, Invalid=1465, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 18:37:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2018-02-02 18:37:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1656. [2018-02-02 18:37:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-02-02 18:37:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2081 transitions. [2018-02-02 18:37:11,651 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2081 transitions. Word has length 41 [2018-02-02 18:37:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:11,651 INFO L432 AbstractCegarLoop]: Abstraction has 1656 states and 2081 transitions. [2018-02-02 18:37:11,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 18:37:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2081 transitions. [2018-02-02 18:37:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 18:37:11,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:11,652 INFO L351 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-02-02 18:37:11,652 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-02-02 18:37:11,652 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-02 18:37:11,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:11,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:11,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:11,653 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:11,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:11,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 18:37:11,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:11,765 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:11,773 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:11,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:11,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:11,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-02-02 18:37:11,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 18:37:11,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 18:37:11,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:37:11,907 INFO L87 Difference]: Start difference. First operand 1656 states and 2081 transitions. Second operand 14 states. [2018-02-02 18:37:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:12,380 INFO L93 Difference]: Finished difference Result 2319 states and 2974 transitions. [2018-02-02 18:37:12,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 18:37:12,380 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-02-02 18:37:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:12,386 INFO L225 Difference]: With dead ends: 2319 [2018-02-02 18:37:12,387 INFO L226 Difference]: Without dead ends: 2319 [2018-02-02 18:37:12,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 18:37:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2018-02-02 18:37:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2095. [2018-02-02 18:37:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2095 states. [2018-02-02 18:37:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 2656 transitions. [2018-02-02 18:37:12,413 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 2656 transitions. Word has length 42 [2018-02-02 18:37:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:12,413 INFO L432 AbstractCegarLoop]: Abstraction has 2095 states and 2656 transitions. [2018-02-02 18:37:12,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 18:37:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2656 transitions. [2018-02-02 18:37:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:37:12,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:12,414 INFO L351 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-02-02 18:37:12,414 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-02-02 18:37:12,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-02 18:37:12,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:12,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:12,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:12,415 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:12,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:12,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:37:12,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:12,477 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:12,487 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:12,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:37:12,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:12,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 18:37:12,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:37:12,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:37:12,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:37:12,597 INFO L87 Difference]: Start difference. First operand 2095 states and 2656 transitions. Second operand 11 states. [2018-02-02 18:37:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:12,758 INFO L93 Difference]: Finished difference Result 2774 states and 3666 transitions. [2018-02-02 18:37:12,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:37:12,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-02 18:37:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:12,774 INFO L225 Difference]: With dead ends: 2774 [2018-02-02 18:37:12,774 INFO L226 Difference]: Without dead ends: 2774 [2018-02-02 18:37:12,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:37:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2018-02-02 18:37:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2161. [2018-02-02 18:37:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2161 states. [2018-02-02 18:37:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2755 transitions. [2018-02-02 18:37:12,822 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2755 transitions. Word has length 54 [2018-02-02 18:37:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:12,822 INFO L432 AbstractCegarLoop]: Abstraction has 2161 states and 2755 transitions. [2018-02-02 18:37:12,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:37:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2755 transitions. [2018-02-02 18:37:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:37:12,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:12,823 INFO L351 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-02-02 18:37:12,823 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-02-02 18:37:12,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-02 18:37:12,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:12,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:12,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:12,825 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:12,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:12,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:37:12,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:12,895 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:12,900 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:12,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 18:37:13,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:13,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-02 18:37:13,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:37:13,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:37:13,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:37:13,057 INFO L87 Difference]: Start difference. First operand 2161 states and 2755 transitions. Second operand 15 states. [2018-02-02 18:37:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:13,416 INFO L93 Difference]: Finished difference Result 3687 states and 4967 transitions. [2018-02-02 18:37:13,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 18:37:13,416 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-02 18:37:13,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:13,431 INFO L225 Difference]: With dead ends: 3687 [2018-02-02 18:37:13,431 INFO L226 Difference]: Without dead ends: 3615 [2018-02-02 18:37:13,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 18:37:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2018-02-02 18:37:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 2996. [2018-02-02 18:37:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2996 states. [2018-02-02 18:37:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 3855 transitions. [2018-02-02 18:37:13,496 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 3855 transitions. Word has length 54 [2018-02-02 18:37:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:13,496 INFO L432 AbstractCegarLoop]: Abstraction has 2996 states and 3855 transitions. [2018-02-02 18:37:13,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:37:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 3855 transitions. [2018-02-02 18:37:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 18:37:13,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:13,498 INFO L351 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-02-02 18:37:13,498 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-02-02 18:37:13,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-02-02 18:37:13,498 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:13,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:13,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:13,499 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:13,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:13,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 18:37:13,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:13,600 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:13,608 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:13,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 18:37:13,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:13,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 18:37:13,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:37:13,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:37:13,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:37:13,703 INFO L87 Difference]: Start difference. First operand 2996 states and 3855 transitions. Second operand 11 states. [2018-02-02 18:37:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:13,894 INFO L93 Difference]: Finished difference Result 3609 states and 4730 transitions. [2018-02-02 18:37:13,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:37:13,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-02 18:37:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:13,906 INFO L225 Difference]: With dead ends: 3609 [2018-02-02 18:37:13,906 INFO L226 Difference]: Without dead ends: 3609 [2018-02-02 18:37:13,907 INFO L554 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-02-02 18:37:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2018-02-02 18:37:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3567. [2018-02-02 18:37:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2018-02-02 18:37:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 4691 transitions. [2018-02-02 18:37:13,988 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 4691 transitions. Word has length 68 [2018-02-02 18:37:13,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:13,988 INFO L432 AbstractCegarLoop]: Abstraction has 3567 states and 4691 transitions. [2018-02-02 18:37:13,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:37:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4691 transitions. [2018-02-02 18:37:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 18:37:13,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:13,990 INFO L351 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-02-02 18:37:13,990 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-02-02 18:37:13,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-02-02 18:37:13,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:13,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:13,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:13,991 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:13,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:14,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 18:37:14,116 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:14,116 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:14,124 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:14,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 18:37:14,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:14,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-02-02 18:37:14,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 18:37:14,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 18:37:14,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-02 18:37:14,268 INFO L87 Difference]: Start difference. First operand 3567 states and 4691 transitions. Second operand 18 states. [2018-02-02 18:37:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:14,936 INFO L93 Difference]: Finished difference Result 6255 states and 8375 transitions. [2018-02-02 18:37:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 18:37:14,936 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-02 18:37:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:14,952 INFO L225 Difference]: With dead ends: 6255 [2018-02-02 18:37:14,953 INFO L226 Difference]: Without dead ends: 6156 [2018-02-02 18:37:14,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 18:37:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6156 states. [2018-02-02 18:37:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6156 to 4675. [2018-02-02 18:37:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4675 states. [2018-02-02 18:37:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4675 states to 4675 states and 6031 transitions. [2018-02-02 18:37:15,022 INFO L78 Accepts]: Start accepts. Automaton has 4675 states and 6031 transitions. Word has length 70 [2018-02-02 18:37:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:15,022 INFO L432 AbstractCegarLoop]: Abstraction has 4675 states and 6031 transitions. [2018-02-02 18:37:15,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 18:37:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4675 states and 6031 transitions. [2018-02-02 18:37:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 18:37:15,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:15,023 INFO L351 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-02-02 18:37:15,023 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-02-02 18:37:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-02-02 18:37:15,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:15,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:15,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:15,024 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:15,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:15,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 18:37:15,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:15,159 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:15,166 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:15,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-02-02 18:37:15,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:15,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-02 18:37:15,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 18:37:15,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 18:37:15,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 18:37:15,330 INFO L87 Difference]: Start difference. First operand 4675 states and 6031 transitions. Second operand 17 states. [2018-02-02 18:37:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:15,845 INFO L93 Difference]: Finished difference Result 6142 states and 8117 transitions. [2018-02-02 18:37:15,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 18:37:15,845 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-02 18:37:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:15,863 INFO L225 Difference]: With dead ends: 6142 [2018-02-02 18:37:15,863 INFO L226 Difference]: Without dead ends: 6004 [2018-02-02 18:37:15,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 18:37:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2018-02-02 18:37:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 4579. [2018-02-02 18:37:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2018-02-02 18:37:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 5837 transitions. [2018-02-02 18:37:15,977 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 5837 transitions. Word has length 84 [2018-02-02 18:37:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:15,977 INFO L432 AbstractCegarLoop]: Abstraction has 4579 states and 5837 transitions. [2018-02-02 18:37:15,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 18:37:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 5837 transitions. [2018-02-02 18:37:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 18:37:15,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:15,979 INFO L351 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-02-02 18:37:15,979 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-02-02 18:37:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-02 18:37:15,979 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:15,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:15,980 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:15,980 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:15,980 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:15,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 18:37:16,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:16,152 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:16,160 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:16,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 18:37:16,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:16,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-02 18:37:16,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 18:37:16,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 18:37:16,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 18:37:16,354 INFO L87 Difference]: Start difference. First operand 4579 states and 5837 transitions. Second operand 18 states. [2018-02-02 18:37:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:16,963 INFO L93 Difference]: Finished difference Result 6614 states and 8422 transitions. [2018-02-02 18:37:16,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 18:37:16,963 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 18:37:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:16,992 INFO L225 Difference]: With dead ends: 6614 [2018-02-02 18:37:16,992 INFO L226 Difference]: Without dead ends: 6515 [2018-02-02 18:37:16,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 18:37:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6515 states. [2018-02-02 18:37:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6515 to 6365. [2018-02-02 18:37:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6365 states. [2018-02-02 18:37:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6365 states to 6365 states and 8191 transitions. [2018-02-02 18:37:17,072 INFO L78 Accepts]: Start accepts. Automaton has 6365 states and 8191 transitions. Word has length 87 [2018-02-02 18:37:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:17,072 INFO L432 AbstractCegarLoop]: Abstraction has 6365 states and 8191 transitions. [2018-02-02 18:37:17,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 18:37:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 6365 states and 8191 transitions. [2018-02-02 18:37:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 18:37:17,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:17,075 INFO L351 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-02-02 18:37:17,075 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-02-02 18:37:17,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1756447406, now seen corresponding path program 1 times [2018-02-02 18:37:17,075 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:17,075 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:17,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:17,076 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:17,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 18:37:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 18:37:17,153 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 18:37:17,195 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 18:37:17,203 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-02-02 18:37:17,204 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-02-02 18:37:17,204 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-02-02 18:37:17,205 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-02-02 18:37:17,205 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-02-02 18:37:17,207 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-02-02 18:37:17,208 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-02-02 18:37:17,209 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-02-02 18:37:17,211 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-02-02 18:37:17,211 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-02-02 18:37:17,212 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-02-02 18:37:17,213 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-02-02 18:37:17,214 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-02-02 18:37:17,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:37:17 BoogieIcfgContainer [2018-02-02 18:37:17,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:37:17,225 INFO L168 Benchmark]: Toolchain (without parser) took 11039.64 ms. Allocated memory was 395.8 MB in the beginning and 868.7 MB in the end (delta: 472.9 MB). Free memory was 349.9 MB in the beginning and 717.6 MB in the end (delta: -367.7 MB). Peak memory consumption was 105.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:37:17,226 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 395.8 MB. Free memory is still 356.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:37:17,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.49 ms. Allocated memory is still 395.8 MB. Free memory was 349.9 MB in the beginning and 339.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:37:17,227 INFO L168 Benchmark]: Boogie Preprocessor took 26.99 ms. Allocated memory is still 395.8 MB. Free memory was 339.3 MB in the beginning and 336.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:37:17,227 INFO L168 Benchmark]: RCFGBuilder took 284.95 ms. Allocated memory is still 395.8 MB. Free memory was 336.7 MB in the beginning and 308.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-02 18:37:17,227 INFO L168 Benchmark]: TraceAbstraction took 10552.82 ms. Allocated memory was 395.8 MB in the beginning and 868.7 MB in the end (delta: 472.9 MB). Free memory was 308.9 MB in the beginning and 717.6 MB in the end (delta: -408.7 MB). Peak memory consumption was 64.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:37:17,228 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.15 ms. Allocated memory is still 395.8 MB. Free memory is still 356.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.49 ms. Allocated memory is still 395.8 MB. Free memory was 349.9 MB in the beginning and 339.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.99 ms. Allocated memory is still 395.8 MB. Free memory was 339.3 MB in the beginning and 336.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 284.95 ms. Allocated memory is still 395.8 MB. Free memory was 336.7 MB in the beginning and 308.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10552.82 ms. Allocated memory was 395.8 MB in the beginning and 868.7 MB in the end (delta: 472.9 MB). Free memory was 308.9 MB in the beginning and 717.6 MB in the end (delta: -408.7 MB). Peak memory consumption was 64.2 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)=0, \old(x1)=12, \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)=12, \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}] [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)=0, \old(x1)=12, \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)=0, \old(x1)=12, \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)=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}] [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)=12, \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}] [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)=0, \old(x1)=12, \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)=0, \old(S)=12, \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)=12, \old(x1)=0, \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, 10.5s OverallTime, 21 OverallIterations, 7 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1975 SDtfs, 5529 SDslu, 4189 SDs, 0 SdLazy, 6189 SolverSat, 1338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1009 GetRequests, 659 SyntacticMatches, 6 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 3.1s 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 6444 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.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, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-37-17-233.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-37-17-233.csv Received shutdown request...