java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/reducercommutativity/avg10_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d63d1fb [2018-01-27 23:01:40,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-27 23:01:40,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-27 23:01:40,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-27 23:01:40,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-27 23:01:40,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-27 23:01:40,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-27 23:01:40,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-27 23:01:40,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-27 23:01:40,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-27 23:01:40,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-27 23:01:40,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-27 23:01:40,626 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-27 23:01:40,627 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-27 23:01:40,628 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-27 23:01:40,631 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-27 23:01:40,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-27 23:01:40,635 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-27 23:01:40,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-27 23:01:40,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-27 23:01:40,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-27 23:01:40,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-27 23:01:40,640 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-27 23:01:40,641 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-27 23:01:40,642 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-27 23:01:40,643 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-27 23:01:40,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-27 23:01:40,644 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-27 23:01:40,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-27 23:01:40,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-27 23:01:40,645 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-27 23:01:40,646 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-27 23:01:40,656 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-27 23:01:40,657 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-27 23:01:40,657 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-27 23:01:40,658 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-27 23:01:40,658 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-27 23:01:40,658 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-27 23:01:40,658 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-27 23:01:40,659 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-27 23:01:40,659 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-27 23:01:40,659 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-27 23:01:40,659 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-27 23:01:40,660 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-27 23:01:40,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-27 23:01:40,660 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-27 23:01:40,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-27 23:01:40,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-27 23:01:40,661 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-27 23:01:40,661 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-27 23:01:40,661 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-27 23:01:40,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-27 23:01:40,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-27 23:01:40,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-27 23:01:40,662 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-27 23:01:40,662 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-27 23:01:40,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-27 23:01:40,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-27 23:01:40,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-27 23:01:40,663 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-27 23:01:40,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-27 23:01:40,664 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-27 23:01:40,664 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-27 23:01:40,664 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-27 23:01:40,664 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-27 23:01:40,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-27 23:01:40,665 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-27 23:01:40,665 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-27 23:01:40,666 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-27 23:01:40,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-27 23:01:40,711 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-27 23:01:40,714 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-27 23:01:40,715 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-27 23:01:40,715 INFO L276 PluginConnector]: CDTParser initialized [2018-01-27 23:01:40,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg10_true-unreach-call_true-termination.i [2018-01-27 23:01:40,832 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-27 23:01:40,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-27 23:01:40,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-27 23:01:40,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-27 23:01:40,847 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-27 23:01:40,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:01:40" (1/1) ... [2018-01-27 23:01:40,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62689477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:40, skipping insertion in model container [2018-01-27 23:01:40,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:01:40" (1/1) ... [2018-01-27 23:01:40,869 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:01:40,889 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:01:41,062 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:01:41,088 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:01:41,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:41 WrapperNode [2018-01-27 23:01:41,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-27 23:01:41,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-27 23:01:41,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-27 23:01:41,100 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-27 23:01:41,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:41" (1/1) ... [2018-01-27 23:01:41,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:41" (1/1) ... [2018-01-27 23:01:41,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:41" (1/1) ... [2018-01-27 23:01:41,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:41" (1/1) ... [2018-01-27 23:01:41,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:41" (1/1) ... [2018-01-27 23:01:41,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:41" (1/1) ... [2018-01-27 23:01:41,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:41" (1/1) ... [2018-01-27 23:01:41,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-27 23:01:41,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-27 23:01:41,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-27 23:01:41,152 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-27 23:01:41,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:41" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-27 23:01:41,219 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-27 23:01:41,220 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-27 23:01:41,220 INFO L136 BoogieDeclarations]: Found implementation of procedure avg [2018-01-27 23:01:41,220 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-27 23:01:41,220 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-27 23:01:41,220 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-27 23:01:41,221 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-27 23:01:41,221 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-27 23:01:41,221 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-27 23:01:41,224 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-27 23:01:41,224 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-27 23:01:41,224 INFO L128 BoogieDeclarations]: Found specification of procedure avg [2018-01-27 23:01:41,225 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-27 23:01:41,225 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-27 23:01:41,225 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-27 23:01:41,688 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-27 23:01:41,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:01:41 BoogieIcfgContainer [2018-01-27 23:01:41,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-27 23:01:41,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-27 23:01:41,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-27 23:01:41,694 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-27 23:01:41,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:01:40" (1/3) ... [2018-01-27 23:01:41,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1458da55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:01:41, skipping insertion in model container [2018-01-27 23:01:41,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:41" (2/3) ... [2018-01-27 23:01:41,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1458da55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:01:41, skipping insertion in model container [2018-01-27 23:01:41,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:01:41" (3/3) ... [2018-01-27 23:01:41,697 INFO L105 eAbstractionObserver]: Analyzing ICFG avg10_true-unreach-call_true-termination.i [2018-01-27 23:01:41,705 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-27 23:01:41,714 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-27 23:01:41,769 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:01:41,769 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:01:41,769 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:01:41,770 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:01:41,770 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:01:41,770 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:01:41,770 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:01:41,770 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-27 23:01:41,771 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:01:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:01:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-27 23:01:41,798 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:41,799 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-27 23:01:41,799 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-27 23:01:41,806 INFO L82 PathProgramCache]: Analyzing trace with hash 114361, now seen corresponding path program 1 times [2018-01-27 23:01:41,808 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:41,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:41,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:41,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:41,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:01:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:01:41,962 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:01:41,972 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:01:41,980 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:01:41,981 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:01:41,981 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:01:41,981 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:01:41,983 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:01:41,984 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:01:41,984 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:01:41,984 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == avgErr0EnsuresViolation======== [2018-01-27 23:01:41,984 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:01:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:01:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-27 23:01:41,987 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:41,987 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:41,988 INFO L371 AbstractCegarLoop]: === Iteration 1 === [avgErr0EnsuresViolation]=== [2018-01-27 23:01:41,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1916485188, now seen corresponding path program 1 times [2018-01-27 23:01:41,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:41,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:41,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:41,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:41,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:42,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 23:01:42,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:01:42,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:01:42,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:01:42,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:01:42,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:01:42,094 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:01:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:42,115 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-01-27 23:01:42,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:01:42,117 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-27 23:01:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:42,130 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:01:42,131 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:01:42,135 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:01:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:01:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:01:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:01:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:01:42,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-01-27 23:01:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:42,256 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:01:42,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:01:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:01:42,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:01:42,261 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:01:42,261 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:01:42,261 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:01:42,261 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:01:42,261 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:01:42,261 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:01:42,261 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:01:42,261 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-27 23:01:42,262 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:01:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:01:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-27 23:01:42,269 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:42,269 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:42,270 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1565773136, now seen corresponding path program 1 times [2018-01-27 23:01:42,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:42,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:42,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:42,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:42,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:42,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-27 23:01:42,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:01:42,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:01:42,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:01:42,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:01:42,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:01:42,364 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:01:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:42,375 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-01-27 23:01:42,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:01:42,376 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 46 [2018-01-27 23:01:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:42,380 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:01:42,380 INFO L226 Difference]: Without dead ends: 50 [2018-01-27 23:01:42,381 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:01:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-27 23:01:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-27 23:01:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-27 23:01:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-27 23:01:42,405 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 46 [2018-01-27 23:01:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:42,406 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-27 23:01:42,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:01:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-27 23:01:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-27 23:01:42,409 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:42,409 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:42,409 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:42,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1555594602, now seen corresponding path program 1 times [2018-01-27 23:01:42,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:42,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:42,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:42,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:42,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:42,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-27 23:01:42,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:01:42,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:01:42,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:01:42,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:01:42,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:01:42,539 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2018-01-27 23:01:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:42,618 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-01-27 23:01:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:01:42,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-01-27 23:01:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:42,621 INFO L225 Difference]: With dead ends: 93 [2018-01-27 23:01:42,621 INFO L226 Difference]: Without dead ends: 55 [2018-01-27 23:01:42,622 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:01:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-27 23:01:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-27 23:01:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-27 23:01:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-27 23:01:42,630 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 51 [2018-01-27 23:01:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:42,630 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-27 23:01:42,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:01:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-27 23:01:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-27 23:01:42,632 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:42,632 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:42,633 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:42,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1858699323, now seen corresponding path program 1 times [2018-01-27 23:01:42,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:42,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:42,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:42,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:42,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:42,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-27 23:01:42,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:42,771 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:01:42,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:42,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-27 23:01:42,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:01:42,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-01-27 23:01:42,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 23:01:42,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 23:01:42,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:01:42,939 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2018-01-27 23:01:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:43,016 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-01-27 23:01:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:01:43,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-27 23:01:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:43,018 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:01:43,019 INFO L226 Difference]: Without dead ends: 57 [2018-01-27 23:01:43,019 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:01:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-27 23:01:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-01-27 23:01:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-27 23:01:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-27 23:01:43,027 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 56 [2018-01-27 23:01:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:43,027 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-27 23:01:43,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 23:01:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-27 23:01:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-27 23:01:43,029 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:43,030 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:43,030 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash 992177361, now seen corresponding path program 1 times [2018-01-27 23:01:43,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:43,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:43,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:43,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:43,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:43,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:01:43,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:01:43,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:01:43,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:01:43,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:01:43,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:01:43,194 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 3 states. [2018-01-27 23:01:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:43,266 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-01-27 23:01:43,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:01:43,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-01-27 23:01:43,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:43,268 INFO L225 Difference]: With dead ends: 82 [2018-01-27 23:01:43,268 INFO L226 Difference]: Without dead ends: 60 [2018-01-27 23:01:43,269 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:01:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-27 23:01:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-01-27 23:01:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-27 23:01:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-27 23:01:43,277 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 71 [2018-01-27 23:01:43,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:43,279 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-27 23:01:43,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:01:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-27 23:01:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-27 23:01:43,282 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:43,282 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:43,282 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:43,282 INFO L82 PathProgramCache]: Analyzing trace with hash 50616265, now seen corresponding path program 1 times [2018-01-27 23:01:43,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:43,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:43,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:43,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:43,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:43,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:01:43,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:43,422 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:43,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:43,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:01:43,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:43,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 23:01:43,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 23:01:43,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 23:01:43,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:01:43,632 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-01-27 23:01:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:43,686 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-01-27 23:01:43,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 23:01:43,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-01-27 23:01:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:43,687 INFO L225 Difference]: With dead ends: 106 [2018-01-27 23:01:43,688 INFO L226 Difference]: Without dead ends: 64 [2018-01-27 23:01:43,688 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:01:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-27 23:01:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-27 23:01:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-27 23:01:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-27 23:01:43,695 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 77 [2018-01-27 23:01:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:43,695 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-27 23:01:43,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 23:01:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-27 23:01:43,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-27 23:01:43,697 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:43,697 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:43,697 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:43,697 INFO L82 PathProgramCache]: Analyzing trace with hash -421320648, now seen corresponding path program 2 times [2018-01-27 23:01:43,697 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:43,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:43,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:43,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:43,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:43,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:01:43,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:43,929 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:43,935 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:01:43,956 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:43,984 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:43,997 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:44,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:01:44,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:44,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-27 23:01:44,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-27 23:01:44,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-27 23:01:44,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:01:44,137 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-27 23:01:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:44,187 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-01-27 23:01:44,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-27 23:01:44,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-01-27 23:01:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:44,188 INFO L225 Difference]: With dead ends: 111 [2018-01-27 23:01:44,188 INFO L226 Difference]: Without dead ends: 69 [2018-01-27 23:01:44,189 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:01:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-27 23:01:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-01-27 23:01:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-27 23:01:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-27 23:01:44,195 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 82 [2018-01-27 23:01:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:44,196 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-27 23:01:44,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-27 23:01:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-27 23:01:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-27 23:01:44,197 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:44,197 INFO L330 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:44,198 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:44,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1798325545, now seen corresponding path program 3 times [2018-01-27 23:01:44,198 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:44,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:44,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:44,199 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:44,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:44,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:01:44,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:44,409 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:44,414 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:01:44,433 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:44,455 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:44,463 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:44,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-27 23:01:44,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:44,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-01-27 23:01:44,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:01:44,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:01:44,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:01:44,729 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 8 states. [2018-01-27 23:01:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:44,826 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-01-27 23:01:44,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:01:44,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-01-27 23:01:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:44,829 INFO L225 Difference]: With dead ends: 124 [2018-01-27 23:01:44,829 INFO L226 Difference]: Without dead ends: 82 [2018-01-27 23:01:44,830 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:01:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-27 23:01:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-01-27 23:01:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-27 23:01:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-27 23:01:44,836 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 87 [2018-01-27 23:01:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:44,837 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-27 23:01:44,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:01:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-27 23:01:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-27 23:01:44,839 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:44,839 INFO L330 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:44,839 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1813629278, now seen corresponding path program 4 times [2018-01-27 23:01:44,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:44,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:44,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:44,841 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:44,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:44,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:01:45,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:45,330 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:01:45,343 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:45,391 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:45,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:01:45,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:45,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:01:45,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:01:45,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:01:45,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:01:45,532 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 8 states. [2018-01-27 23:01:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:45,597 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-27 23:01:45,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:01:45,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2018-01-27 23:01:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:45,600 INFO L225 Difference]: With dead ends: 131 [2018-01-27 23:01:45,600 INFO L226 Difference]: Without dead ends: 84 [2018-01-27 23:01:45,600 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:01:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-27 23:01:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-01-27 23:01:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-27 23:01:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-01-27 23:01:45,609 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 107 [2018-01-27 23:01:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:45,610 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-01-27 23:01:45,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:01:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-01-27 23:01:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-27 23:01:45,612 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:45,612 INFO L330 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:45,612 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:45,612 INFO L82 PathProgramCache]: Analyzing trace with hash -350524019, now seen corresponding path program 5 times [2018-01-27 23:01:45,613 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:45,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:45,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:45,614 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:45,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:45,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:01:45,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:45,811 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:45,818 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-27 23:01:45,834 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:45,841 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:45,845 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:45,851 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:45,862 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:45,869 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:45,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-27 23:01:45,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:45,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-01-27 23:01:45,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:01:45,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:01:45,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:01:45,964 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 11 states. [2018-01-27 23:01:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:46,239 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-27 23:01:46,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:01:46,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-01-27 23:01:46,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:46,241 INFO L225 Difference]: With dead ends: 144 [2018-01-27 23:01:46,241 INFO L226 Difference]: Without dead ends: 97 [2018-01-27 23:01:46,241 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:01:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-27 23:01:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-01-27 23:01:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-27 23:01:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-01-27 23:01:46,251 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 112 [2018-01-27 23:01:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:46,251 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-01-27 23:01:46,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:01:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-01-27 23:01:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-27 23:01:46,253 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:46,254 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 7, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:46,254 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:46,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1533196744, now seen corresponding path program 6 times [2018-01-27 23:01:46,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:46,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:46,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:46,255 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:46,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:46,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-01-27 23:01:46,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:46,578 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:01:46,590 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:46,612 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:46,621 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:46,626 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:46,633 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:46,639 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:46,640 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:46,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-01-27 23:01:46,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:46,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-01-27 23:01:46,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:01:46,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:01:46,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:01:46,742 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 11 states. [2018-01-27 23:01:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:46,845 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-01-27 23:01:46,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:01:46,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2018-01-27 23:01:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:46,847 INFO L225 Difference]: With dead ends: 161 [2018-01-27 23:01:46,847 INFO L226 Difference]: Without dead ends: 109 [2018-01-27 23:01:46,848 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:01:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-27 23:01:46,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-01-27 23:01:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-27 23:01:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-01-27 23:01:46,858 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 132 [2018-01-27 23:01:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:46,858 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-01-27 23:01:46,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:01:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-01-27 23:01:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-27 23:01:46,860 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:46,860 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 8, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:46,860 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash 960280545, now seen corresponding path program 7 times [2018-01-27 23:01:46,860 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:46,860 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:46,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:46,861 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:46,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:46,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:01:47,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:47,077 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:47,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:47,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:01:47,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:47,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-27 23:01:47,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:01:47,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:01:47,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:01:47,188 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 11 states. [2018-01-27 23:01:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:47,220 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2018-01-27 23:01:47,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-27 23:01:47,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 143 [2018-01-27 23:01:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:47,221 INFO L225 Difference]: With dead ends: 168 [2018-01-27 23:01:47,221 INFO L226 Difference]: Without dead ends: 110 [2018-01-27 23:01:47,222 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:01:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-27 23:01:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-01-27 23:01:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-27 23:01:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-01-27 23:01:47,230 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 143 [2018-01-27 23:01:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:47,230 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-01-27 23:01:47,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:01:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-01-27 23:01:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-27 23:01:47,232 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:47,233 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 8, 8, 8, 8, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:47,233 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 722219152, now seen corresponding path program 8 times [2018-01-27 23:01:47,233 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:47,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:47,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:47,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:47,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:47,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:01:48,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:48,157 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:48,164 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:01:48,177 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:48,195 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:48,197 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:48,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:01:48,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:48,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-27 23:01:48,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:01:48,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:01:48,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:01:48,245 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 12 states. [2018-01-27 23:01:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:48,292 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2018-01-27 23:01:48,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:01:48,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2018-01-27 23:01:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:48,295 INFO L225 Difference]: With dead ends: 173 [2018-01-27 23:01:48,295 INFO L226 Difference]: Without dead ends: 115 [2018-01-27 23:01:48,295 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:01:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-27 23:01:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-01-27 23:01:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-27 23:01:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-01-27 23:01:48,303 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 148 [2018-01-27 23:01:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:48,303 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-01-27 23:01:48,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:01:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-01-27 23:01:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-27 23:01:48,305 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:48,305 INFO L330 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:48,305 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:48,305 INFO L82 PathProgramCache]: Analyzing trace with hash -221786815, now seen corresponding path program 9 times [2018-01-27 23:01:48,305 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:48,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:48,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:48,306 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:48,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:48,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:01:48,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:48,479 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:48,484 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:01:48,498 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:48,504 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:48,509 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:48,515 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:48,516 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:48,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 124 proven. 21 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-01-27 23:01:48,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:48,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-01-27 23:01:48,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-27 23:01:48,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-27 23:01:48,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:01:48,718 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 16 states. [2018-01-27 23:01:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:48,853 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2018-01-27 23:01:48,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-27 23:01:48,853 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 153 [2018-01-27 23:01:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:48,855 INFO L225 Difference]: With dead ends: 183 [2018-01-27 23:01:48,855 INFO L226 Difference]: Without dead ends: 125 [2018-01-27 23:01:48,855 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:01:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-27 23:01:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-01-27 23:01:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-27 23:01:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-01-27 23:01:48,862 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 153 [2018-01-27 23:01:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:48,862 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-01-27 23:01:48,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-27 23:01:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-01-27 23:01:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-01-27 23:01:48,864 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:48,864 INFO L330 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 12, 11, 10, 10, 10, 10, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:48,864 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash 284097414, now seen corresponding path program 10 times [2018-01-27 23:01:48,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:48,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:48,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:48,866 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:48,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:48,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-01-27 23:01:49,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:49,109 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:49,115 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-27 23:01:49,162 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:49,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 198 proven. 38 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2018-01-27 23:01:49,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:49,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:01:49,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:01:49,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:01:49,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:01:49,204 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 8 states. [2018-01-27 23:01:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:49,236 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2018-01-27 23:01:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:01:49,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2018-01-27 23:01:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:49,238 INFO L225 Difference]: With dead ends: 192 [2018-01-27 23:01:49,238 INFO L226 Difference]: Without dead ends: 130 [2018-01-27 23:01:49,238 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:01:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-27 23:01:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-01-27 23:01:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-27 23:01:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-01-27 23:01:49,245 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 173 [2018-01-27 23:01:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:49,246 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-01-27 23:01:49,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:01:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-01-27 23:01:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-01-27 23:01:49,247 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:49,247 INFO L330 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 11, 10, 10, 10, 10, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:49,247 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash -81679888, now seen corresponding path program 11 times [2018-01-27 23:01:49,248 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:49,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:49,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:49,249 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:49,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:49,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-01-27 23:01:50,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:50,011 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:01:50,023 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:50,039 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,053 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,069 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,084 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,102 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,117 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,133 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,152 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,169 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,190 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,254 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:50,262 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:50,267 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 296 proven. 60 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-01-27 23:01:50,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:50,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-01-27 23:01:50,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:01:50,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:01:50,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:01:50,423 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 9 states. [2018-01-27 23:01:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:50,557 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2018-01-27 23:01:50,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:01:50,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2018-01-27 23:01:50,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:50,558 INFO L225 Difference]: With dead ends: 202 [2018-01-27 23:01:50,558 INFO L226 Difference]: Without dead ends: 135 [2018-01-27 23:01:50,559 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:01:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-27 23:01:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-01-27 23:01:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-27 23:01:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2018-01-27 23:01:50,566 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 188 [2018-01-27 23:01:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:50,566 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2018-01-27 23:01:50,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:01:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-01-27 23:01:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-01-27 23:01:50,569 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:50,569 INFO L330 BasicCegarLoop]: trace histogram [21, 18, 18, 18, 18, 11, 10, 10, 10, 10, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:50,569 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1047765050, now seen corresponding path program 12 times [2018-01-27 23:01:50,569 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:50,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:50,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:50,570 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:50,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:50,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 0 proven. 505 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2018-01-27 23:01:51,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:51,278 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:51,284 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-27 23:01:51,307 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:51,320 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:51,338 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:51,350 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:51,354 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:51,359 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:51,364 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:51,365 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:51,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 420 proven. 10 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2018-01-27 23:01:51,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:51,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-01-27 23:01:51,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:01:51,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:01:51,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:01:51,471 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 12 states. [2018-01-27 23:01:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:51,565 INFO L93 Difference]: Finished difference Result 222 states and 233 transitions. [2018-01-27 23:01:51,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-27 23:01:51,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 203 [2018-01-27 23:01:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:51,568 INFO L225 Difference]: With dead ends: 222 [2018-01-27 23:01:51,568 INFO L226 Difference]: Without dead ends: 150 [2018-01-27 23:01:51,568 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:01:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-27 23:01:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2018-01-27 23:01:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-27 23:01:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-01-27 23:01:51,575 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 203 [2018-01-27 23:01:51,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:51,576 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-01-27 23:01:51,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:01:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-01-27 23:01:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-01-27 23:01:51,577 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:51,578 INFO L330 BasicCegarLoop]: trace histogram [24, 21, 21, 21, 21, 11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:51,578 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2063285656, now seen corresponding path program 13 times [2018-01-27 23:01:51,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:51,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:51,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:51,579 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:51,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:51,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-01-27 23:01:51,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:51,828 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:51,833 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:51,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 552 proven. 119 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2018-01-27 23:01:52,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:52,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-27 23:01:52,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:01:52,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:01:52,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:01:52,018 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 11 states. [2018-01-27 23:01:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:52,056 INFO L93 Difference]: Finished difference Result 234 states and 244 transitions. [2018-01-27 23:01:52,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-27 23:01:52,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 224 [2018-01-27 23:01:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:52,058 INFO L225 Difference]: With dead ends: 234 [2018-01-27 23:01:52,058 INFO L226 Difference]: Without dead ends: 151 [2018-01-27 23:01:52,058 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:01:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-27 23:01:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2018-01-27 23:01:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-27 23:01:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2018-01-27 23:01:52,068 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 224 [2018-01-27 23:01:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:52,068 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2018-01-27 23:01:52,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:01:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-01-27 23:01:52,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-01-27 23:01:52,070 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:52,070 INFO L330 BasicCegarLoop]: trace histogram [27, 24, 24, 24, 24, 11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:52,071 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:52,071 INFO L82 PathProgramCache]: Analyzing trace with hash -862784050, now seen corresponding path program 14 times [2018-01-27 23:01:52,071 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:52,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:52,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:52,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:01:52,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:52,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1811 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2018-01-27 23:01:52,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:52,705 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:52,712 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:01:52,732 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:52,766 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:52,779 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:52,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1811 backedges. 710 proven. 156 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-01-27 23:01:52,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:52,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-27 23:01:52,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:01:52,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:01:52,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:01:52,857 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand 12 states. [2018-01-27 23:01:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:52,947 INFO L93 Difference]: Finished difference Result 244 states and 254 transitions. [2018-01-27 23:01:52,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:01:52,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 239 [2018-01-27 23:01:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:52,948 INFO L225 Difference]: With dead ends: 244 [2018-01-27 23:01:52,948 INFO L226 Difference]: Without dead ends: 156 [2018-01-27 23:01:52,949 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:01:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-27 23:01:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2018-01-27 23:01:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-27 23:01:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-01-27 23:01:52,956 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 239 [2018-01-27 23:01:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:52,957 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-01-27 23:01:52,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:01:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-01-27 23:01:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-01-27 23:01:52,959 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:52,960 INFO L330 BasicCegarLoop]: trace histogram [30, 27, 27, 27, 27, 11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:52,960 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:52,960 INFO L82 PathProgramCache]: Analyzing trace with hash -965124312, now seen corresponding path program 15 times [2018-01-27 23:01:52,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:52,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:52,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:52,961 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:52,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:52,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 0 proven. 1090 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2018-01-27 23:01:53,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:53,252 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:53,266 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:01:53,288 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:53,304 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:53,320 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:53,325 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:53,332 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:01:53,333 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:53,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 894 proven. 24 refuted. 0 times theorem prover too weak. 1286 trivial. 0 not checked. [2018-01-27 23:01:54,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:54,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-01-27 23:01:54,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-27 23:01:54,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-27 23:01:54,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:01:54,292 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 16 states. [2018-01-27 23:01:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:54,651 INFO L93 Difference]: Finished difference Result 261 states and 272 transitions. [2018-01-27 23:01:54,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-27 23:01:54,652 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 254 [2018-01-27 23:01:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:54,653 INFO L225 Difference]: With dead ends: 261 [2018-01-27 23:01:54,653 INFO L226 Difference]: Without dead ends: 168 [2018-01-27 23:01:54,654 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:01:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-27 23:01:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-01-27 23:01:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-27 23:01:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2018-01-27 23:01:54,661 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 254 [2018-01-27 23:01:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:54,661 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2018-01-27 23:01:54,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-27 23:01:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2018-01-27 23:01:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-27 23:01:54,663 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:54,663 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:54,663 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:54,663 INFO L82 PathProgramCache]: Analyzing trace with hash -107417130, now seen corresponding path program 16 times [2018-01-27 23:01:54,664 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:54,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:54,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:54,665 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:54,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:54,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2662 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:01:55,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:55,297 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:01:55,309 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:55,377 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:55,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2662 backedges. 1092 proven. 44 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:01:55,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:55,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:01:55,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:01:55,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:01:55,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:01:55,571 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand 8 states. [2018-01-27 23:01:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:55,955 INFO L93 Difference]: Finished difference Result 241 states and 246 transitions. [2018-01-27 23:01:55,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:01:55,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 275 [2018-01-27 23:01:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:55,958 INFO L225 Difference]: With dead ends: 241 [2018-01-27 23:01:55,958 INFO L226 Difference]: Without dead ends: 174 [2018-01-27 23:01:55,959 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:01:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-27 23:01:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2018-01-27 23:01:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-27 23:01:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 174 transitions. [2018-01-27 23:01:55,966 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 174 transitions. Word has length 275 [2018-01-27 23:01:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:55,967 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 174 transitions. [2018-01-27 23:01:55,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:01:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 174 transitions. [2018-01-27 23:01:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-01-27 23:01:55,970 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:55,970 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:55,971 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1930855010, now seen corresponding path program 17 times [2018-01-27 23:01:55,971 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:55,971 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:55,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:55,972 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:55,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:56,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:01:56,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:56,804 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:01:56,817 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:56,837 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,851 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,865 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,879 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,893 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,907 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,924 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,947 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,961 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,970 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,983 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:56,998 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:57,009 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:57,025 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:57,035 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:57,050 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:57,084 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:57,184 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:57,256 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:57,401 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:57,637 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:01:57,645 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:57,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1092 proven. 70 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:01:57,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:57,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-01-27 23:01:57,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:01:57,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:01:57,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:01:57,836 INFO L87 Difference]: Start difference. First operand 170 states and 174 transitions. Second operand 9 states. [2018-01-27 23:01:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:58,271 INFO L93 Difference]: Finished difference Result 247 states and 252 transitions. [2018-01-27 23:01:58,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:01:58,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2018-01-27 23:01:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:58,274 INFO L225 Difference]: With dead ends: 247 [2018-01-27 23:01:58,274 INFO L226 Difference]: Without dead ends: 180 [2018-01-27 23:01:58,275 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:01:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-27 23:01:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-01-27 23:01:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-27 23:01:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 180 transitions. [2018-01-27 23:01:58,284 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 180 transitions. Word has length 281 [2018-01-27 23:01:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:58,284 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 180 transitions. [2018-01-27 23:01:58,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:01:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 180 transitions. [2018-01-27 23:01:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-01-27 23:01:58,286 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:58,287 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:58,287 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:58,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1169943706, now seen corresponding path program 18 times [2018-01-27 23:01:58,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:58,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:58,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:58,295 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:58,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:58,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:01:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2720 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:01:58,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:01:58,725 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:01:58,730 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-27 23:01:58,756 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:58,770 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:58,792 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:58,810 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:58,826 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:58,840 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:58,852 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:58,869 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:58,886 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:58,910 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:58,936 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:59,012 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:59,076 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:59,099 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:59,159 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:01:59,161 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:01:59,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:01:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2720 backedges. 1092 proven. 102 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:01:59,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:01:59,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-27 23:01:59,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-27 23:01:59,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-27 23:01:59,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-27 23:01:59,246 INFO L87 Difference]: Start difference. First operand 176 states and 180 transitions. Second operand 10 states. [2018-01-27 23:01:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:01:59,427 INFO L93 Difference]: Finished difference Result 253 states and 258 transitions. [2018-01-27 23:01:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-27 23:01:59,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 287 [2018-01-27 23:01:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:01:59,430 INFO L225 Difference]: With dead ends: 253 [2018-01-27 23:01:59,430 INFO L226 Difference]: Without dead ends: 186 [2018-01-27 23:01:59,431 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-27 23:01:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-27 23:01:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2018-01-27 23:01:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-27 23:01:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 186 transitions. [2018-01-27 23:01:59,438 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 186 transitions. Word has length 287 [2018-01-27 23:01:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:01:59,439 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 186 transitions. [2018-01-27 23:01:59,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-27 23:01:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 186 transitions. [2018-01-27 23:01:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-01-27 23:01:59,441 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:01:59,442 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:01:59,442 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:01:59,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1350120238, now seen corresponding path program 19 times [2018-01-27 23:01:59,442 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:01:59,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:01:59,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:59,443 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:01:59,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:01:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:01:59,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:02:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:02:00,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:02:00,723 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:02:00,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:02:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:02:00,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:02:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1092 proven. 140 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:02:01,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:02:01,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-27 23:02:01,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:02:01,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:02:01,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:02:01,020 INFO L87 Difference]: Start difference. First operand 182 states and 186 transitions. Second operand 11 states. [2018-01-27 23:02:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:02:01,569 INFO L93 Difference]: Finished difference Result 259 states and 264 transitions. [2018-01-27 23:02:01,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-27 23:02:01,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 293 [2018-01-27 23:02:01,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:02:01,571 INFO L225 Difference]: With dead ends: 259 [2018-01-27 23:02:01,571 INFO L226 Difference]: Without dead ends: 192 [2018-01-27 23:02:01,572 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:02:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-27 23:02:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2018-01-27 23:02:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-27 23:02:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 192 transitions. [2018-01-27 23:02:01,581 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 192 transitions. Word has length 293 [2018-01-27 23:02:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:02:01,583 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 192 transitions. [2018-01-27 23:02:01,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:02:01,583 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 192 transitions. [2018-01-27 23:02:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-01-27 23:02:01,585 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:02:01,585 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:02:01,585 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:02:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash -537305866, now seen corresponding path program 20 times [2018-01-27 23:02:01,586 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:02:01,586 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:02:01,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:01,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:02:01,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:02:01,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:02:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2802 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:02:02,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:02:02,737 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:02:02,744 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:02:02,768 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:02:02,800 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:02:02,805 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:02:02,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:02:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2802 backedges. 1092 proven. 184 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:02:02,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:02:02,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-27 23:02:02,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:02:02,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:02:02,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:02:02,938 INFO L87 Difference]: Start difference. First operand 188 states and 192 transitions. Second operand 12 states. [2018-01-27 23:02:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:02:02,976 INFO L93 Difference]: Finished difference Result 261 states and 266 transitions. [2018-01-27 23:02:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:02:02,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 299 [2018-01-27 23:02:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:02:02,979 INFO L225 Difference]: With dead ends: 261 [2018-01-27 23:02:02,979 INFO L226 Difference]: Without dead ends: 194 [2018-01-27 23:02:02,979 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:02:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-27 23:02:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-01-27 23:02:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-27 23:02:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 198 transitions. [2018-01-27 23:02:02,987 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 198 transitions. Word has length 299 [2018-01-27 23:02:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:02:02,988 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 198 transitions. [2018-01-27 23:02:02,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:02:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2018-01-27 23:02:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-01-27 23:02:02,991 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:02:02,991 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:02:02,991 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:02:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash 47517886, now seen corresponding path program 21 times [2018-01-27 23:02:02,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:02:02,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:02:02,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:02,994 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:02:02,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:02:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:02:03,823 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:02:03,866 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:02:03,885 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:02:03,895 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:02:03,905 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:02:03,905 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:02:03,905 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:02:03,981 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:02:03,981 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:02:03,981 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:02:03,981 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:02:03,981 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:02:03,982 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:02:03,982 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:02:03,982 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-27 23:02:03,982 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:02:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:02:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-27 23:02:03,984 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:02:03,984 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:02:03,984 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-27 23:02:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1744644142, now seen corresponding path program 1 times [2018-01-27 23:02:03,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:02:03,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:02:03,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:03,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:02:03,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:02:03,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:02:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-27 23:02:03,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:02:03,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:02:03,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:02:03,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:02:03,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:02:03,996 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:02:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:02:03,999 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-01-27 23:02:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:02:03,999 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2018-01-27 23:02:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:02:04,000 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:02:04,000 INFO L226 Difference]: Without dead ends: 48 [2018-01-27 23:02:04,000 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:02:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-27 23:02:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-27 23:02:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-27 23:02:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-27 23:02:04,005 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 44 [2018-01-27 23:02:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:02:04,005 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-27 23:02:04,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:02:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-27 23:02:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-27 23:02:04,006 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:02:04,006 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:02:04,007 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-27 23:02:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash -421729992, now seen corresponding path program 1 times [2018-01-27 23:02:04,007 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:02:04,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:02:04,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:04,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:02:04,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:02:04,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:02:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-27 23:02:04,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:02:04,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:02:04,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:02:04,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:02:04,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:02:04,076 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2018-01-27 23:02:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:02:04,166 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-01-27 23:02:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:02:04,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-01-27 23:02:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:02:04,168 INFO L225 Difference]: With dead ends: 89 [2018-01-27 23:02:04,168 INFO L226 Difference]: Without dead ends: 53 [2018-01-27 23:02:04,168 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:02:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-27 23:02:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-27 23:02:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-27 23:02:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-27 23:02:04,173 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 49 [2018-01-27 23:02:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:02:04,173 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-27 23:02:04,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:02:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-27 23:02:04,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-27 23:02:04,174 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:02:04,174 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:02:04,174 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-27 23:02:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash 293037607, now seen corresponding path program 1 times [2018-01-27 23:02:04,174 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:02:04,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:02:04,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:04,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:02:04,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:02:04,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:02:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-27 23:02:04,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:02:04,247 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:02:04,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:02:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:02:04,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:02:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-27 23:02:04,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:02:04,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-01-27 23:02:04,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 23:02:04,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 23:02:04,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:02:04,408 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-01-27 23:02:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:02:04,544 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-01-27 23:02:04,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:02:04,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-01-27 23:02:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:02:04,545 INFO L225 Difference]: With dead ends: 90 [2018-01-27 23:02:04,545 INFO L226 Difference]: Without dead ends: 55 [2018-01-27 23:02:04,546 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:02:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-27 23:02:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-27 23:02:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-27 23:02:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-27 23:02:04,550 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 54 [2018-01-27 23:02:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:02:04,550 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-27 23:02:04,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 23:02:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-27 23:02:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-27 23:02:04,551 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:02:04,551 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:02:04,552 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-27 23:02:04,552 INFO L82 PathProgramCache]: Analyzing trace with hash -812374477, now seen corresponding path program 1 times [2018-01-27 23:02:04,552 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:02:04,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:02:04,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:04,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:02:04,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:02:04,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:02:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:02:04,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:02:04,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:02:04,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:02:04,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:02:04,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:02:04,623 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 3 states. [2018-01-27 23:02:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:02:04,734 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-27 23:02:04,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:02:04,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-01-27 23:02:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:02:04,735 INFO L225 Difference]: With dead ends: 78 [2018-01-27 23:02:04,735 INFO L226 Difference]: Without dead ends: 58 [2018-01-27 23:02:04,736 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:02:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-27 23:02:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-01-27 23:02:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-27 23:02:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-27 23:02:04,740 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 69 [2018-01-27 23:02:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:02:04,741 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-27 23:02:04,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:02:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-27 23:02:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-27 23:02:04,742 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:02:04,742 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:02:04,742 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-27 23:02:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash -31232213, now seen corresponding path program 1 times [2018-01-27 23:02:04,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:02:04,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:02:04,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:04,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:02:04,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:02:04,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:02:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:02:04,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:02:04,890 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:02:04,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:02:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:02:04,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:02:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:02:05,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:02:05,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 23:02:05,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 23:02:05,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 23:02:05,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:02:05,090 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2018-01-27 23:02:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:02:05,231 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-01-27 23:02:05,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 23:02:05,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-01-27 23:02:05,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:02:05,233 INFO L225 Difference]: With dead ends: 102 [2018-01-27 23:02:05,233 INFO L226 Difference]: Without dead ends: 62 [2018-01-27 23:02:05,233 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:02:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-27 23:02:05,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-01-27 23:02:05,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-27 23:02:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-27 23:02:05,236 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 75 [2018-01-27 23:02:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:02:05,236 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-27 23:02:05,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 23:02:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-27 23:02:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-27 23:02:05,237 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:02:05,237 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:02:05,237 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-27 23:02:05,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2096525478, now seen corresponding path program 2 times [2018-01-27 23:02:05,237 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:02:05,237 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:02:05,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:05,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:02:05,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:02:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:02:05,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:02:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:02:05,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:02:05,495 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:02:05,505 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:02:05,519 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:02:05,532 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:02:05,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:02:05,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:02:05,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-27 23:02:05,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:02:05,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-27 23:02:05,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:02:06,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:02:06,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-27 23:02:06,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:02:06,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-27 23:02:06,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:02:06,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:02:06,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-27 23:02:06,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:02:06,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-27 23:02:06,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:02:06,269 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#x~5.base| Int)) (and (= (store |c_old(#valid)| |main_~#x~5.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#x~5.base|) 0))) is different from true [2018-01-27 23:02:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-01-27 23:02:06,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:02:06,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-01-27 23:02:06,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:02:06,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:02:06,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-01-27 23:02:06,331 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 9 states. [2018-01-27 23:02:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:02:06,746 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-27 23:02:06,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-27 23:02:06,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-27 23:02:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:02:06,746 INFO L225 Difference]: With dead ends: 106 [2018-01-27 23:02:06,747 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:02:06,747 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=112, Unknown=1, NotChecked=22, Total=182 [2018-01-27 23:02:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:02:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:02:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:02:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:02:06,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-01-27 23:02:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:02:06,748 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:02:06,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:02:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:02:06,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:02:06,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:02:06 BoogieIcfgContainer [2018-01-27 23:02:06,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-27 23:02:06,753 INFO L168 Benchmark]: Toolchain (without parser) took 25920.68 ms. Allocated memory was 299.4 MB in the beginning and 739.2 MB in the end (delta: 439.9 MB). Free memory was 260.1 MB in the beginning and 346.8 MB in the end (delta: -86.8 MB). Peak memory consumption was 353.1 MB. Max. memory is 5.3 GB. [2018-01-27 23:02:06,754 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 299.4 MB. Free memory is still 264.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-27 23:02:06,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.52 ms. Allocated memory is still 299.4 MB. Free memory was 258.1 MB in the beginning and 250.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:02:06,755 INFO L168 Benchmark]: Boogie Preprocessor took 51.15 ms. Allocated memory is still 299.4 MB. Free memory was 250.1 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:02:06,755 INFO L168 Benchmark]: RCFGBuilder took 538.31 ms. Allocated memory is still 299.4 MB. Free memory was 248.1 MB in the beginning and 231.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:02:06,756 INFO L168 Benchmark]: TraceAbstraction took 25061.97 ms. Allocated memory was 299.4 MB in the beginning and 739.2 MB in the end (delta: 439.9 MB). Free memory was 231.2 MB in the beginning and 346.8 MB in the end (delta: -115.7 MB). Peak memory consumption was 324.2 MB. Max. memory is 5.3 GB. [2018-01-27 23:02:06,758 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 299.4 MB. Free memory is still 264.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 259.52 ms. Allocated memory is still 299.4 MB. Free memory was 258.1 MB in the beginning and 250.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.15 ms. Allocated memory is still 299.4 MB. Free memory was 250.1 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 538.31 ms. Allocated memory is still 299.4 MB. Free memory was 248.1 MB in the beginning and 231.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 25061.97 ms. Allocated memory was 299.4 MB in the beginning and 739.2 MB in the end (delta: 439.9 MB). Free memory was 231.2 MB in the beginning and 346.8 MB in the end (delta: -115.7 MB). Peak memory consumption was 324.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) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 4]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: avgErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L17] FCALL int x[10]; VAL [x={55:0}] [L18] int temp; [L19] int ret; [L20] int ret2; [L21] int ret5; [L23] int i = 0; VAL [i=0, x={55:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=0, x={55:0}] [L23] i++ VAL [i=1, x={55:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=1, x={55:0}] [L23] i++ VAL [i=2, x={55:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=2, x={55:0}] [L23] i++ VAL [i=3, x={55:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=3, x={55:0}] [L23] i++ VAL [i=4, x={55:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=4, x={55:0}] [L23] i++ VAL [i=5, x={55:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=5, x={55:0}] [L23] i++ VAL [i=6, x={55:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=6, x={55:0}] [L23] i++ VAL [i=7, x={55:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=7, x={55:0}] [L23] i++ VAL [i=8, x={55:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, i=8, x={55:0}] [L23] i++ VAL [i=9, x={55:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=52, i=9, x={55:0}] [L23] i++ VAL [i=10, x={55:0}] [L23] COND FALSE !(i < 10) VAL [i=10, x={55:0}] [L27] CALL, EXPR avg(x) VAL [x={55:0}] [L6] int i; [L7] long long ret; [L8] ret = 0 [L9] i = 0 VAL [i=0, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=0, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=0, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=1, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=1, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=1, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=2, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=2, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=2, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=3, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=3, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=3, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=4, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=4, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=4, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=5, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=5, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=5, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=6, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=6, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=6, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=7, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=7, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=7, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=8, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=8, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=8, ret=0, x={55:0}, x={55:0}, x[i]=-1] [L10] ret = ret + x[i] [L9] i++ VAL [i=9, ret=-1, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=9, ret=-1, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=9, ret=-1, x={55:0}, x={55:0}, x[i]=52] [L10] ret = ret + x[i] [L9] i++ VAL [i=10, ret=51, x={55:0}, x={55:0}] [L9] COND FALSE !(i < 10) VAL [i=10, ret=51, x={55:0}, x={55:0}] [L12] RET return ret / 10; VAL [\result=5, i=10, ret=51, x={55:0}, x={55:0}] [L27] EXPR avg(x) VAL [avg(x)=5, i=10, x={55:0}] [L27] ret = avg(x) [L29] EXPR, FCALL x[0] VAL [i=10, ret=5, x={55:0}, x[0]=0] [L29] temp=x[0] [L29] EXPR, FCALL x[1] VAL [i=10, ret=5, temp=0, x={55:0}, x[1]=0] [L29] FCALL x[0] = x[1] VAL [i=10, ret=5, temp=0, x={55:0}, x[1]=0] [L29] FCALL x[1] = temp VAL [i=10, ret=5, temp=0, x={55:0}] [L30] CALL, EXPR avg(x) VAL [x={55:0}] [L6] int i; [L7] long long ret; [L8] ret = 0 [L9] i = 0 VAL [i=0, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=0, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=0, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=1, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=1, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=1, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=2, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=2, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=2, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=3, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=3, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=3, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=4, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=4, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=4, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=5, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=5, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=5, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=6, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=6, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=6, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=7, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=7, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=7, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=8, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=8, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=8, ret=0, x={55:0}, x={55:0}, x[i]=-1] [L10] ret = ret + x[i] [L9] i++ VAL [i=9, ret=-1, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=9, ret=-1, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=9, ret=-1, x={55:0}, x={55:0}, x[i]=52] [L10] ret = ret + x[i] [L9] i++ VAL [i=10, ret=51, x={55:0}, x={55:0}] [L9] COND FALSE !(i < 10) VAL [i=10, ret=51, x={55:0}, x={55:0}] [L12] RET return ret / 10; VAL [\result=5, i=10, ret=51, x={55:0}, x={55:0}] [L30] EXPR avg(x) VAL [avg(x)=5, i=10, ret=5, temp=0, x={55:0}] [L30] ret2 = avg(x) [L31] EXPR, FCALL x[0] VAL [i=10, ret=5, ret2=5, temp=0, x={55:0}, x[0]=0] [L31] temp=x[0] [L32] int i =0 ; VAL [i=0, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L32] COND TRUE i<10 -1 VAL [i=0, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L33] EXPR, FCALL x[i+1] VAL [i=0, i=10, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=0, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L32] i++ VAL [i=10, i=1, ret=5, ret2=5, temp=0, x={55:0}] [L32] COND TRUE i<10 -1 VAL [i=1, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L33] EXPR, FCALL x[i+1] VAL [i=1, i=10, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=1, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L32] i++ VAL [i=2, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=2, ret=5, ret2=5, temp=0, x={55:0}] [L33] EXPR, FCALL x[i+1] VAL [i=10, i=2, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=2, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L32] i++ VAL [i=10, i=3, ret=5, ret2=5, temp=0, x={55:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=3, ret=5, ret2=5, temp=0, x={55:0}] [L33] EXPR, FCALL x[i+1] VAL [i=3, i=10, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=3, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L32] i++ VAL [i=10, i=4, ret=5, ret2=5, temp=0, x={55:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=4, ret=5, ret2=5, temp=0, x={55:0}] [L33] EXPR, FCALL x[i+1] VAL [i=10, i=4, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=4, i=10, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L32] i++ VAL [i=5, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L32] COND TRUE i<10 -1 VAL [i=5, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L33] EXPR, FCALL x[i+1] VAL [i=10, i=5, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=5, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L32] i++ VAL [i=10, i=6, ret=5, ret2=5, temp=0, x={55:0}] [L32] COND TRUE i<10 -1 VAL [i=6, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L33] EXPR, FCALL x[i+1] VAL [i=10, i=6, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=6, i=10, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=0] [L32] i++ VAL [i=10, i=7, ret=5, ret2=5, temp=0, x={55:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=7, ret=5, ret2=5, temp=0, x={55:0}] [L33] EXPR, FCALL x[i+1] VAL [i=7, i=10, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=-1] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=7, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=-1] [L32] i++ VAL [i=8, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=8, ret=5, ret2=5, temp=0, x={55:0}] [L33] EXPR, FCALL x[i+1] VAL [i=10, i=8, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=52] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=8, ret=5, ret2=5, temp=0, x={55:0}, x[i+1]=52] [L32] i++ VAL [i=10, i=9, ret=5, ret2=5, temp=0, x={55:0}] [L32] COND FALSE !(i<10 -1) VAL [i=9, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L35] FCALL x[10 -1] = temp VAL [i=9, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L36] CALL, EXPR avg(x) VAL [x={55:0}] [L6] int i; [L7] long long ret; [L8] ret = 0 [L9] i = 0 VAL [i=0, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=0, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=0, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=1, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=1, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=1, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=2, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=2, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=2, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=3, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=3, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=3, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=4, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=4, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=4, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=5, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=5, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=5, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=6, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=6, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=6, ret=0, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=7, ret=0, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=7, ret=0, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=7, ret=0, x={55:0}, x={55:0}, x[i]=-1] [L10] ret = ret + x[i] [L9] i++ VAL [i=8, ret=-1, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=8, ret=-1, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=8, ret=-1, x={55:0}, x={55:0}, x[i]=52] [L10] ret = ret + x[i] [L9] i++ VAL [i=9, ret=51, x={55:0}, x={55:0}] [L9] COND TRUE i < 10 VAL [i=9, ret=51, x={55:0}, x={55:0}] [L10] EXPR, FCALL x[i] VAL [i=9, ret=51, x={55:0}, x={55:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=10, ret=51, x={55:0}, x={55:0}] [L9] COND FALSE !(i < 10) VAL [i=10, ret=51, x={55:0}, x={55:0}] [L12] RET return ret / 10; VAL [\result=5, i=10, ret=51, x={55:0}, x={55:0}] [L36] EXPR avg(x) VAL [avg(x)=5, i=9, i=10, ret=5, ret2=5, temp=0, x={55:0}] [L36] ret5 = avg(x) [L38] COND FALSE !(ret != ret2 || ret !=ret5) VAL [i=10, i=9, ret=5, ret2=5, ret5=5, temp=0, x={55:0}] [L41] return 1; VAL [\result=1, i=9, i=10, ret=5, ret2=5, ret5=5, temp=0, x={55:0}] [L41] return 1; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. UNSAFE Result, 21.7s OverallTime, 25 OverallIterations, 33 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1203 SDtfs, 510 SDslu, 6022 SDs, 0 SdLazy, 913 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3977 GetRequests, 3807 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 86 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 8099 NumberOfCodeBlocks, 7532 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 7749 ConstructedInterpolants, 0 QuantifiedInterpolants, 2120593 SizeOfPredicates, 21 NumberOfNonLiveVariables, 6170 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 45 InterpolantComputations, 4 PerfectInterpolantSequences, 41777/48062 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 15]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. SAFE Result, 2.7s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 286 SDtfs, 75 SDslu, 325 SDs, 0 SdLazy, 168 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 208 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=5, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 580 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 571 ConstructedInterpolants, 35 QuantifiedInterpolants, 91665 SizeOfPredicates, 5 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 337/360 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/avg10_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-27_23-02-06-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/avg10_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-27_23-02-06-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/avg10_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-27_23-02-06-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/avg10_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-27_23-02-06-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/avg10_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-27_23-02-06-774.csv Received shutdown request...