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/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:32:49,642 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:32:49,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:32:49,660 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:32:49,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:32:49,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:32:49,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:32:49,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:32:49,667 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:32:49,668 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:32:49,669 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:32:49,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:32:49,671 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:32:49,672 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:32:49,673 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:32:49,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:32:49,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:32:49,681 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:32:49,682 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:32:49,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:32:49,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:32:49,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:32:49,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:32:49,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:32:49,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:32:49,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:32:49,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:32:49,692 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:32:49,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:32:49,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:32:49,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:32:49,693 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-23 14:32:49,702 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:32:49,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:32:49,703 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:32:49,703 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:32:49,704 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:32:49,704 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:32:49,704 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:32:49,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:32:49,704 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:32:49,705 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:32:49,705 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:32:49,705 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:32:49,705 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:32:49,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:32:49,705 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:32:49,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:32:49,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:32:49,706 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:32:49,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:32:49,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:32:49,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:32:49,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:32:49,706 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:32:49,707 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:32:49,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:32:49,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:32:49,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:32:49,707 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:32:49,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:32:49,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:32:49,708 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:32:49,708 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:32:49,708 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:32:49,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:32:49,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:32:49,709 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:32:49,709 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:32:49,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:32:49,754 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:32:49,758 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:32:49,759 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:32:49,760 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:32:49,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i [2018-01-23 14:32:49,937 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:32:49,942 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:32:49,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:32:49,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:32:49,949 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:32:49,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:32:49" (1/1) ... [2018-01-23 14:32:49,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec38a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:49, skipping insertion in model container [2018-01-23 14:32:49,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:32:49" (1/1) ... [2018-01-23 14:32:49,968 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:32:50,007 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:32:50,137 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:32:50,167 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:32:50,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:50 WrapperNode [2018-01-23 14:32:50,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:32:50,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:32:50,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:32:50,182 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:32:50,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:50" (1/1) ... [2018-01-23 14:32:50,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:50" (1/1) ... [2018-01-23 14:32:50,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:50" (1/1) ... [2018-01-23 14:32:50,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:50" (1/1) ... [2018-01-23 14:32:50,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:50" (1/1) ... [2018-01-23 14:32:50,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:50" (1/1) ... [2018-01-23 14:32:50,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:50" (1/1) ... [2018-01-23 14:32:50,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:32:50,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:32:50,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:32:50,230 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:32:50,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:50" (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-23 14:32:50,293 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:32:50,294 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:32:50,294 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-23 14:32:50,294 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-23 14:32:50,294 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-23 14:32:50,294 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:32:50,295 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:32:50,295 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:32:50,295 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:32:50,295 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:32:50,295 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:32:50,295 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:32:50,295 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:32:50,296 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:32:50,296 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:32:50,296 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:32:50,296 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-23 14:32:50,296 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-23 14:32:50,296 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-23 14:32:50,297 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:32:50,297 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:32:50,297 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:32:50,806 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:32:50,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:32:50 BoogieIcfgContainer [2018-01-23 14:32:50,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:32:50,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:32:50,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:32:50,810 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:32:50,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:32:49" (1/3) ... [2018-01-23 14:32:50,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfb1463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:32:50, skipping insertion in model container [2018-01-23 14:32:50,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:32:50" (2/3) ... [2018-01-23 14:32:50,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfb1463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:32:50, skipping insertion in model container [2018-01-23 14:32:50,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:32:50" (3/3) ... [2018-01-23 14:32:50,814 INFO L105 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_false-valid-memtrack.i [2018-01-23 14:32:50,823 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:32:50,831 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-23 14:32:50,872 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:32:50,872 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:32:50,872 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:32:50,872 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:32:50,873 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:32:50,873 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:32:50,873 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:32:50,873 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_dataErr0EnsuresViolation======== [2018-01-23 14:32:50,874 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:32:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-23 14:32:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:32:50,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:50,907 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:50,907 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:32:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash 187522691, now seen corresponding path program 1 times [2018-01-23 14:32:50,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:50,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:50,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:50,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:50,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:51,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:51,117 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-23 14:32:51,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:51,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:32:51,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:51,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:51,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:51,214 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2018-01-23 14:32:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:51,264 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2018-01-23 14:32:51,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:51,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-23 14:32:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:51,273 INFO L225 Difference]: With dead ends: 252 [2018-01-23 14:32:51,273 INFO L226 Difference]: Without dead ends: 98 [2018-01-23 14:32:51,278 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-23 14:32:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-23 14:32:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-23 14:32:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-01-23 14:32:51,314 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 25 [2018-01-23 14:32:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:51,314 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-01-23 14:32:51,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-01-23 14:32:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-23 14:32:51,316 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:51,316 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:51,316 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:32:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash 358615040, now seen corresponding path program 1 times [2018-01-23 14:32:51,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:51,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:51,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:51,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:51,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:51,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:51,416 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-23 14:32:51,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:51,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:32:51,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:32:51,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:32:51,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:51,419 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 4 states. [2018-01-23 14:32:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:51,470 INFO L93 Difference]: Finished difference Result 240 states and 269 transitions. [2018-01-23 14:32:51,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:32:51,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-23 14:32:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:51,473 INFO L225 Difference]: With dead ends: 240 [2018-01-23 14:32:51,473 INFO L226 Difference]: Without dead ends: 150 [2018-01-23 14:32:51,474 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:32:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-23 14:32:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-01-23 14:32:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-23 14:32:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2018-01-23 14:32:51,484 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 27 [2018-01-23 14:32:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:51,484 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2018-01-23 14:32:51,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:32:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2018-01-23 14:32:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-23 14:32:51,485 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:51,485 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:51,485 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:32:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1671536572, now seen corresponding path program 1 times [2018-01-23 14:32:51,486 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:51,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:51,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:51,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:51,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:51,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:51,548 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-23 14:32:51,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:51,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:32:51,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:51,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:51,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:51,549 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand 3 states. [2018-01-23 14:32:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:51,617 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2018-01-23 14:32:51,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:51,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-23 14:32:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:51,620 INFO L225 Difference]: With dead ends: 151 [2018-01-23 14:32:51,620 INFO L226 Difference]: Without dead ends: 150 [2018-01-23 14:32:51,621 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-23 14:32:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-23 14:32:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-23 14:32:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2018-01-23 14:32:51,633 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 29 [2018-01-23 14:32:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:51,634 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2018-01-23 14:32:51,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2018-01-23 14:32:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-23 14:32:51,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:51,636 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:51,636 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:32:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1893588353, now seen corresponding path program 1 times [2018-01-23 14:32:51,637 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:51,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:51,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:51,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:51,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:51,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:51,710 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-23 14:32:51,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:51,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:32:51,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:51,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:51,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:51,712 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand 3 states. [2018-01-23 14:32:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:51,742 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2018-01-23 14:32:51,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:51,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-23 14:32:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:51,744 INFO L225 Difference]: With dead ends: 306 [2018-01-23 14:32:51,744 INFO L226 Difference]: Without dead ends: 164 [2018-01-23 14:32:51,746 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-23 14:32:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2018-01-23 14:32:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-23 14:32:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2018-01-23 14:32:51,758 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 44 [2018-01-23 14:32:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:51,759 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2018-01-23 14:32:51,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2018-01-23 14:32:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-23 14:32:51,761 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:51,761 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:51,761 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:32:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash 178943670, now seen corresponding path program 1 times [2018-01-23 14:32:51,761 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:51,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:51,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:51,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:51,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:51,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:32:51,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:32:51,859 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:32:51,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:51,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:32:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:32:51,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:32:51,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-23 14:32:51,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:32:51,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:32:51,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:32:51,989 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 5 states. [2018-01-23 14:32:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:52,017 INFO L93 Difference]: Finished difference Result 324 states and 361 transitions. [2018-01-23 14:32:52,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:32:52,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-23 14:32:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:52,019 INFO L225 Difference]: With dead ends: 324 [2018-01-23 14:32:52,020 INFO L226 Difference]: Without dead ends: 178 [2018-01-23 14:32:52,020 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:32:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-23 14:32:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2018-01-23 14:32:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-23 14:32:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-01-23 14:32:52,036 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 51 [2018-01-23 14:32:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:52,036 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-01-23 14:32:52,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:32:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-01-23 14:32:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:32:52,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:52,038 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:52,038 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:32:52,039 INFO L82 PathProgramCache]: Analyzing trace with hash 977028767, now seen corresponding path program 2 times [2018-01-23 14:32:52,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:52,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:52,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:52,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:52,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:32:52,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:32:52,145 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-23 14:32:52,160 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:32:52,193 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:32:52,220 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:32:52,221 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:32:52,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:32:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:32:52,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:32:52,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-23 14:32:52,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:32:52,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:32:52,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:32:52,284 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 6 states. [2018-01-23 14:32:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:52,332 INFO L93 Difference]: Finished difference Result 342 states and 379 transitions. [2018-01-23 14:32:52,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:32:52,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-01-23 14:32:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:52,334 INFO L225 Difference]: With dead ends: 342 [2018-01-23 14:32:52,334 INFO L226 Difference]: Without dead ends: 182 [2018-01-23 14:32:52,335 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:32:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-23 14:32:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-23 14:32:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-23 14:32:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2018-01-23 14:32:52,345 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 58 [2018-01-23 14:32:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:52,346 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2018-01-23 14:32:52,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:32:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2018-01-23 14:32:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-23 14:32:52,348 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:52,348 INFO L322 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:52,348 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:32:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash 885354134, now seen corresponding path program 3 times [2018-01-23 14:32:52,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:52,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:52,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,350 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:32:52,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:32:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:32:52,470 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:32:52,492 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:32:52,506 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:32:52,531 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:32:52,531 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:32:52,532 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:32:52,532 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:32:52,532 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:32:52,532 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:32:52,532 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:32:52,532 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == freeDataErr0EnsuresViolation======== [2018-01-23 14:32:52,533 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:32:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-23 14:32:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:32:52,536 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:52,536 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:52,536 INFO L371 AbstractCegarLoop]: === Iteration 1 === [freeDataErr0EnsuresViolation]=== [2018-01-23 14:32:52,536 INFO L82 PathProgramCache]: Analyzing trace with hash 631302393, now seen corresponding path program 1 times [2018-01-23 14:32:52,537 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:52,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:52,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:52,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:52,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:52,550 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-23 14:32:52,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:52,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:32:52,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:32:52,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:32:52,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:32:52,551 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2018-01-23 14:32:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:52,560 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-01-23 14:32:52,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:32:52,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-23 14:32:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:52,561 INFO L225 Difference]: With dead ends: 251 [2018-01-23 14:32:52,561 INFO L226 Difference]: Without dead ends: 118 [2018-01-23 14:32:52,562 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:32:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-23 14:32:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-23 14:32:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-23 14:32:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2018-01-23 14:32:52,569 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 24 [2018-01-23 14:32:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:52,569 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2018-01-23 14:32:52,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:32:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2018-01-23 14:32:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-23 14:32:52,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:52,571 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:52,571 INFO L371 AbstractCegarLoop]: === Iteration 2 === [freeDataErr0EnsuresViolation]=== [2018-01-23 14:32:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash -60214454, now seen corresponding path program 1 times [2018-01-23 14:32:52,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:52,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:52,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:52,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:52,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:52,615 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-23 14:32:52,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:52,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:32:52,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:52,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:52,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:52,617 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 3 states. [2018-01-23 14:32:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:52,630 INFO L93 Difference]: Finished difference Result 229 states and 257 transitions. [2018-01-23 14:32:52,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:52,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-23 14:32:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:52,632 INFO L225 Difference]: With dead ends: 229 [2018-01-23 14:32:52,632 INFO L226 Difference]: Without dead ends: 119 [2018-01-23 14:32:52,633 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-23 14:32:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-23 14:32:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-23 14:32:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-01-23 14:32:52,638 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 54 [2018-01-23 14:32:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:52,638 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-01-23 14:32:52,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-01-23 14:32:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-23 14:32:52,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:52,639 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:52,639 INFO L371 AbstractCegarLoop]: === Iteration 3 === [freeDataErr0EnsuresViolation]=== [2018-01-23 14:32:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash 152237805, now seen corresponding path program 1 times [2018-01-23 14:32:52,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:52,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:52,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:52,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:52,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:52,705 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-23 14:32:52,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:52,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:32:52,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:32:52,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:32:52,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:52,707 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 4 states. [2018-01-23 14:32:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:52,732 INFO L93 Difference]: Finished difference Result 278 states and 309 transitions. [2018-01-23 14:32:52,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:32:52,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-23 14:32:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:52,736 INFO L225 Difference]: With dead ends: 278 [2018-01-23 14:32:52,736 INFO L226 Difference]: Without dead ends: 167 [2018-01-23 14:32:52,737 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-23 14:32:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-23 14:32:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-01-23 14:32:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-23 14:32:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2018-01-23 14:32:52,747 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 56 [2018-01-23 14:32:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:52,748 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2018-01-23 14:32:52,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:32:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2018-01-23 14:32:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:32:52,749 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:52,750 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:52,750 INFO L371 AbstractCegarLoop]: === Iteration 4 === [freeDataErr0EnsuresViolation]=== [2018-01-23 14:32:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash -536266093, now seen corresponding path program 1 times [2018-01-23 14:32:52,750 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:52,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:52,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:52,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:52,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:52,789 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-23 14:32:52,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:52,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:32:52,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:52,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:52,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:52,791 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 3 states. [2018-01-23 14:32:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:52,801 INFO L93 Difference]: Finished difference Result 190 states and 208 transitions. [2018-01-23 14:32:52,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:52,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-01-23 14:32:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:52,804 INFO L225 Difference]: With dead ends: 190 [2018-01-23 14:32:52,804 INFO L226 Difference]: Without dead ends: 168 [2018-01-23 14:32:52,804 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-23 14:32:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-01-23 14:32:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-23 14:32:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2018-01-23 14:32:52,812 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 58 [2018-01-23 14:32:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:52,813 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2018-01-23 14:32:52,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2018-01-23 14:32:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:32:52,814 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:52,815 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:52,815 INFO L371 AbstractCegarLoop]: === Iteration 5 === [freeDataErr0EnsuresViolation]=== [2018-01-23 14:32:52,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2124613995, now seen corresponding path program 1 times [2018-01-23 14:32:52,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:52,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:52,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:52,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:52,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:52,874 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-23 14:32:52,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:52,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:32:52,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:32:52,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:32:52,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:52,876 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand 4 states. [2018-01-23 14:32:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:52,932 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2018-01-23 14:32:52,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:32:52,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-01-23 14:32:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:52,933 INFO L225 Difference]: With dead ends: 293 [2018-01-23 14:32:52,933 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:32:52,934 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:32:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:32:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:32:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:32:52,935 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-01-23 14:32:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:52,935 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:32:52,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:32:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:32:52,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:32:52,939 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:32:52,939 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:32:52,939 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:32:52,939 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:32:52,939 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:32:52,940 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:32:52,940 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:32:52,940 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:32:52,940 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:32:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-23 14:32:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:32:52,942 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:52,942 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:32:52,942 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:32:52,943 INFO L82 PathProgramCache]: Analyzing trace with hash 242168, now seen corresponding path program 1 times [2018-01-23 14:32:52,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:52,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:52,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:52,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:32:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:32:52,948 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:32:52,949 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:32:52,951 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:32:52,952 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:32:52,952 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:32:52,952 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:32:52,952 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:32:52,952 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:32:52,952 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:32:52,952 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:32:52,952 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:32:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-23 14:32:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-23 14:32:52,954 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:52,954 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:52,954 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:32:52,955 INFO L82 PathProgramCache]: Analyzing trace with hash -920378739, now seen corresponding path program 1 times [2018-01-23 14:32:52,955 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:52,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:52,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:52,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:52,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:52,964 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-23 14:32:52,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:52,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:32:52,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:32:52,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:32:52,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:32:52,965 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2018-01-23 14:32:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:52,972 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-01-23 14:32:52,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:32:52,972 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-23 14:32:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:52,973 INFO L225 Difference]: With dead ends: 251 [2018-01-23 14:32:52,973 INFO L226 Difference]: Without dead ends: 124 [2018-01-23 14:32:52,974 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:32:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-23 14:32:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-23 14:32:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-23 14:32:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-23 14:32:52,980 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 16 [2018-01-23 14:32:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:52,980 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-23 14:32:52,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:32:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-23 14:32:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:32:52,981 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:52,982 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:52,982 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:32:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1643632883, now seen corresponding path program 1 times [2018-01-23 14:32:52,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:52,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:52,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:52,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:52,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,007 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-23 14:32:53,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:32:53,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:53,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:53,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:53,008 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 3 states. [2018-01-23 14:32:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,034 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2018-01-23 14:32:53,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:53,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-23 14:32:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,035 INFO L225 Difference]: With dead ends: 241 [2018-01-23 14:32:53,036 INFO L226 Difference]: Without dead ends: 125 [2018-01-23 14:32:53,036 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-23 14:32:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-23 14:32:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-23 14:32:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-23 14:32:53,042 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 48 [2018-01-23 14:32:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,043 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-23 14:32:53,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-23 14:32:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-23 14:32:53,044 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,044 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,044 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:32:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1336549616, now seen corresponding path program 1 times [2018-01-23 14:32:53,045 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,100 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-23 14:32:53,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:32:53,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:32:53,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:32:53,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:53,102 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 4 states. [2018-01-23 14:32:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,124 INFO L93 Difference]: Finished difference Result 290 states and 321 transitions. [2018-01-23 14:32:53,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:32:53,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-23 14:32:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,126 INFO L225 Difference]: With dead ends: 290 [2018-01-23 14:32:53,126 INFO L226 Difference]: Without dead ends: 173 [2018-01-23 14:32:53,127 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-23 14:32:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-23 14:32:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-01-23 14:32:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-23 14:32:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-01-23 14:32:53,138 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 50 [2018-01-23 14:32:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,138 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-01-23 14:32:53,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:32:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-01-23 14:32:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:32:53,140 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,140 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,141 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:32:53,141 INFO L82 PathProgramCache]: Analyzing trace with hash 518887702, now seen corresponding path program 1 times [2018-01-23 14:32:53,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,200 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-23 14:32:53,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:32:53,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:53,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:53,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:53,201 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 3 states. [2018-01-23 14:32:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,212 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2018-01-23 14:32:53,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:53,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-01-23 14:32:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,215 INFO L225 Difference]: With dead ends: 202 [2018-01-23 14:32:53,215 INFO L226 Difference]: Without dead ends: 174 [2018-01-23 14:32:53,215 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-23 14:32:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-01-23 14:32:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-23 14:32:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-01-23 14:32:53,224 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 52 [2018-01-23 14:32:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,224 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2018-01-23 14:32:53,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2018-01-23 14:32:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:32:53,226 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,226 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,226 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:32:53,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1219952280, now seen corresponding path program 1 times [2018-01-23 14:32:53,226 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,277 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-23 14:32:53,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:32:53,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:32:53,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:32:53,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:53,279 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 4 states. [2018-01-23 14:32:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,323 INFO L93 Difference]: Finished difference Result 299 states and 331 transitions. [2018-01-23 14:32:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:32:53,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-01-23 14:32:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,324 INFO L225 Difference]: With dead ends: 299 [2018-01-23 14:32:53,324 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:32:53,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:53,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:32:53,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:32:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:32:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:32:53,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-01-23 14:32:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,326 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:32:53,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:32:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:32:53,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:32:53,328 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:32:53,328 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:32:53,329 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:32:53,329 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:32:53,329 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:32:53,329 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:32:53,329 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:32:53,329 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:32:53,329 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:32:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-23 14:32:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-23 14:32:53,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,331 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,331 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:32:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash -9896274, now seen corresponding path program 1 times [2018-01-23 14:32:53,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,341 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-23 14:32:53,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:32:53,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:32:53,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:32:53,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:32:53,343 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2018-01-23 14:32:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,349 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-01-23 14:32:53,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:32:53,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-23 14:32:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,350 INFO L225 Difference]: With dead ends: 251 [2018-01-23 14:32:53,350 INFO L226 Difference]: Without dead ends: 122 [2018-01-23 14:32:53,351 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:32:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-23 14:32:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-23 14:32:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-23 14:32:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-01-23 14:32:53,357 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 14 [2018-01-23 14:32:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,357 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-01-23 14:32:53,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:32:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-01-23 14:32:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:32:53,359 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,359 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,359 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:32:53,359 INFO L82 PathProgramCache]: Analyzing trace with hash 780411694, now seen corresponding path program 1 times [2018-01-23 14:32:53,359 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,359 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,402 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-23 14:32:53,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:32:53,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:53,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:53,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:53,403 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 3 states. [2018-01-23 14:32:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,444 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2018-01-23 14:32:53,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:53,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-23 14:32:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,446 INFO L225 Difference]: With dead ends: 237 [2018-01-23 14:32:53,446 INFO L226 Difference]: Without dead ends: 123 [2018-01-23 14:32:53,447 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-23 14:32:53,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-23 14:32:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-23 14:32:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-01-23 14:32:53,452 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 46 [2018-01-23 14:32:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,453 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-01-23 14:32:53,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-01-23 14:32:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:32:53,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,454 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,454 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:32:53,454 INFO L82 PathProgramCache]: Analyzing trace with hash -820954671, now seen corresponding path program 1 times [2018-01-23 14:32:53,454 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,508 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-23 14:32:53,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:32:53,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:32:53,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:32:53,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:53,510 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 4 states. [2018-01-23 14:32:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,530 INFO L93 Difference]: Finished difference Result 286 states and 317 transitions. [2018-01-23 14:32:53,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:32:53,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-23 14:32:53,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,532 INFO L225 Difference]: With dead ends: 286 [2018-01-23 14:32:53,532 INFO L226 Difference]: Without dead ends: 171 [2018-01-23 14:32:53,533 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-23 14:32:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-23 14:32:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-01-23 14:32:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-23 14:32:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2018-01-23 14:32:53,540 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 48 [2018-01-23 14:32:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,541 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2018-01-23 14:32:53,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:32:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2018-01-23 14:32:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-23 14:32:53,542 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,543 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,543 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:32:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1560314743, now seen corresponding path program 1 times [2018-01-23 14:32:53,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,575 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-23 14:32:53,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:32:53,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:53,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:53,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:53,576 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand 3 states. [2018-01-23 14:32:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,602 INFO L93 Difference]: Finished difference Result 198 states and 216 transitions. [2018-01-23 14:32:53,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:53,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-01-23 14:32:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,604 INFO L225 Difference]: With dead ends: 198 [2018-01-23 14:32:53,604 INFO L226 Difference]: Without dead ends: 172 [2018-01-23 14:32:53,605 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:53,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-23 14:32:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-01-23 14:32:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-23 14:32:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2018-01-23 14:32:53,612 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 50 [2018-01-23 14:32:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,613 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-01-23 14:32:53,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2018-01-23 14:32:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-23 14:32:53,614 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,614 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,614 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:32:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2054594183, now seen corresponding path program 1 times [2018-01-23 14:32:53,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,673 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-23 14:32:53,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:32:53,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:32:53,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:32:53,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:53,674 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 4 states. [2018-01-23 14:32:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,729 INFO L93 Difference]: Finished difference Result 297 states and 329 transitions. [2018-01-23 14:32:53,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:32:53,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-23 14:32:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,731 INFO L225 Difference]: With dead ends: 297 [2018-01-23 14:32:53,731 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:32:53,732 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:32:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:32:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:32:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:32:53,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-01-23 14:32:53,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,733 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:32:53,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:32:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:32:53,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:32:53,735 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:32:53,735 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:32:53,735 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:32:53,735 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:32:53,735 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:32:53,735 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:32:53,735 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:32:53,735 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-23 14:32:53,735 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:32:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-23 14:32:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-23 14:32:53,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,738 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,738 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-23 14:32:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash 986487837, now seen corresponding path program 1 times [2018-01-23 14:32:53,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,770 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-23 14:32:53,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:32:53,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:53,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:53,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:53,771 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2018-01-23 14:32:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,784 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2018-01-23 14:32:53,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:53,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-23 14:32:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,785 INFO L225 Difference]: With dead ends: 252 [2018-01-23 14:32:53,785 INFO L226 Difference]: Without dead ends: 98 [2018-01-23 14:32:53,786 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-23 14:32:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-23 14:32:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-23 14:32:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-01-23 14:32:53,791 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 30 [2018-01-23 14:32:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,791 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-01-23 14:32:53,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-01-23 14:32:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:32:53,792 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,792 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,792 INFO L371 AbstractCegarLoop]: === Iteration 2 === [appendErr0EnsuresViolation]=== [2018-01-23 14:32:53,792 INFO L82 PathProgramCache]: Analyzing trace with hash -131508032, now seen corresponding path program 1 times [2018-01-23 14:32:53,793 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:53,841 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-23 14:32:53,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:53,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:32:53,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:32:53,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:32:53,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:53,842 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 4 states. [2018-01-23 14:32:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:53,867 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-01-23 14:32:53,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:32:53,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-23 14:32:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:53,869 INFO L225 Difference]: With dead ends: 236 [2018-01-23 14:32:53,869 INFO L226 Difference]: Without dead ends: 146 [2018-01-23 14:32:53,870 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-23 14:32:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-23 14:32:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-01-23 14:32:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-23 14:32:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2018-01-23 14:32:53,877 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 32 [2018-01-23 14:32:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:53,877 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2018-01-23 14:32:53,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:32:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2018-01-23 14:32:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-23 14:32:53,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:53,878 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:53,878 INFO L371 AbstractCegarLoop]: === Iteration 3 === [appendErr0EnsuresViolation]=== [2018-01-23 14:32:53,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1463594598, now seen corresponding path program 1 times [2018-01-23 14:32:53,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:53,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:53,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:53,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:53,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:54,123 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-23 14:32:54,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:54,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-23 14:32:54,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-23 14:32:54,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-23 14:32:54,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:32:54,125 INFO L87 Difference]: Start difference. First operand 146 states and 162 transitions. Second operand 10 states. [2018-01-23 14:32:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:54,972 INFO L93 Difference]: Finished difference Result 297 states and 333 transitions. [2018-01-23 14:32:54,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-23 14:32:54,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-23 14:32:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:54,975 INFO L225 Difference]: With dead ends: 297 [2018-01-23 14:32:54,975 INFO L226 Difference]: Without dead ends: 159 [2018-01-23 14:32:54,976 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-01-23 14:32:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-23 14:32:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-01-23 14:32:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-23 14:32:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 173 transitions. [2018-01-23 14:32:54,987 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 173 transitions. Word has length 34 [2018-01-23 14:32:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:54,987 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 173 transitions. [2018-01-23 14:32:54,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-23 14:32:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2018-01-23 14:32:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-23 14:32:54,989 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:54,989 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:54,990 INFO L371 AbstractCegarLoop]: === Iteration 4 === [appendErr0EnsuresViolation]=== [2018-01-23 14:32:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2120152481, now seen corresponding path program 1 times [2018-01-23 14:32:54,990 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:54,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:54,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:54,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:54,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:55,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:55,043 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-23 14:32:55,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:55,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:32:55,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:32:55,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:32:55,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:55,044 INFO L87 Difference]: Start difference. First operand 156 states and 173 transitions. Second operand 3 states. [2018-01-23 14:32:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:55,062 INFO L93 Difference]: Finished difference Result 308 states and 348 transitions. [2018-01-23 14:32:55,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:32:55,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-01-23 14:32:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:55,064 INFO L225 Difference]: With dead ends: 308 [2018-01-23 14:32:55,064 INFO L226 Difference]: Without dead ends: 170 [2018-01-23 14:32:55,065 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:32:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-23 14:32:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2018-01-23 14:32:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-23 14:32:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2018-01-23 14:32:55,073 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 177 transitions. Word has length 49 [2018-01-23 14:32:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:55,074 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 177 transitions. [2018-01-23 14:32:55,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:32:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2018-01-23 14:32:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-23 14:32:55,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:55,075 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:55,075 INFO L371 AbstractCegarLoop]: === Iteration 5 === [appendErr0EnsuresViolation]=== [2018-01-23 14:32:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1396331574, now seen corresponding path program 1 times [2018-01-23 14:32:55,075 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:55,075 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:55,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:55,076 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:55,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:55,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:32:55,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:32:55,119 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-23 14:32:55,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:55,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:32:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:32:55,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:32:55,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-23 14:32:55,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:32:55,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:32:55,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:32:55,212 INFO L87 Difference]: Start difference. First operand 160 states and 177 transitions. Second operand 5 states. [2018-01-23 14:32:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:55,236 INFO L93 Difference]: Finished difference Result 326 states and 366 transitions. [2018-01-23 14:32:55,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:32:55,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-23 14:32:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:55,238 INFO L225 Difference]: With dead ends: 326 [2018-01-23 14:32:55,238 INFO L226 Difference]: Without dead ends: 184 [2018-01-23 14:32:55,240 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:32:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-23 14:32:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 174. [2018-01-23 14:32:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-23 14:32:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-01-23 14:32:55,249 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 56 [2018-01-23 14:32:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:55,250 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2018-01-23 14:32:55,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:32:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2018-01-23 14:32:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-23 14:32:55,251 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:55,251 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:32:55,251 INFO L371 AbstractCegarLoop]: === Iteration 6 === [appendErr0EnsuresViolation]=== [2018-01-23 14:32:55,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1486251393, now seen corresponding path program 2 times [2018-01-23 14:32:55,251 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:55,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:55,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:55,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:55,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:55,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:32:55,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:32:55,303 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-23 14:32:55,313 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:32:55,341 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:32:55,345 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:32:55,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:32:55,404 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc34.base| Int)) (and (= (select |c_old(#valid)| |append_#t~malloc34.base|) 0) (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc34.base| 1)))) is different from true [2018-01-23 14:32:55,427 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1))) is different from true [2018-01-23 14:32:55,433 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (let ((.cse0 (store |c_old(#valid)| |create_data_#t~malloc3.base| 1))) (and (= (select .cse0 |create_data_#t~malloc4.base|) 0) (= |c_#valid| (store .cse0 |create_data_#t~malloc4.base| 1))))) is different from true [2018-01-23 14:32:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:32:55,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:32:55,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-01-23 14:32:55,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:32:55,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:32:55,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=21, Unknown=3, NotChecked=30, Total=72 [2018-01-23 14:32:55,532 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 9 states. [2018-01-23 14:32:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:55,695 INFO L93 Difference]: Finished difference Result 381 states and 429 transitions. [2018-01-23 14:32:55,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:32:55,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-01-23 14:32:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:55,697 INFO L225 Difference]: With dead ends: 381 [2018-01-23 14:32:55,697 INFO L226 Difference]: Without dead ends: 221 [2018-01-23 14:32:55,699 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=42, Unknown=9, NotChecked=48, Total=132 [2018-01-23 14:32:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-23 14:32:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 210. [2018-01-23 14:32:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-23 14:32:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 233 transitions. [2018-01-23 14:32:55,715 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 233 transitions. Word has length 63 [2018-01-23 14:32:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:55,715 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 233 transitions. [2018-01-23 14:32:55,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:32:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 233 transitions. [2018-01-23 14:32:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-23 14:32:55,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:55,717 INFO L322 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:55,717 INFO L371 AbstractCegarLoop]: === Iteration 7 === [appendErr0EnsuresViolation]=== [2018-01-23 14:32:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash -69162451, now seen corresponding path program 1 times [2018-01-23 14:32:55,717 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:55,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:55,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:55,718 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:32:55,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:55,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-23 14:32:55,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:55,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:32:55,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:32:55,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:32:55,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:32:55,868 INFO L87 Difference]: Start difference. First operand 210 states and 233 transitions. Second operand 6 states. [2018-01-23 14:32:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:56,182 INFO L93 Difference]: Finished difference Result 450 states and 509 transitions. [2018-01-23 14:32:56,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:32:56,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-01-23 14:32:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:56,185 INFO L225 Difference]: With dead ends: 450 [2018-01-23 14:32:56,185 INFO L226 Difference]: Without dead ends: 258 [2018-01-23 14:32:56,186 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:32:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-23 14:32:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 218. [2018-01-23 14:32:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-23 14:32:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2018-01-23 14:32:56,203 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 72 [2018-01-23 14:32:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:56,203 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2018-01-23 14:32:56,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:32:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2018-01-23 14:32:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-23 14:32:56,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:56,205 INFO L322 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:56,206 INFO L371 AbstractCegarLoop]: === Iteration 8 === [appendErr0EnsuresViolation]=== [2018-01-23 14:32:56,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1881714573, now seen corresponding path program 1 times [2018-01-23 14:32:56,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:56,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:56,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:56,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:56,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:56,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-23 14:32:56,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:56,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:32:56,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:32:56,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:32:56,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:32:56,291 INFO L87 Difference]: Start difference. First operand 218 states and 241 transitions. Second operand 4 states. [2018-01-23 14:32:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:56,332 INFO L93 Difference]: Finished difference Result 426 states and 482 transitions. [2018-01-23 14:32:56,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:32:56,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-01-23 14:32:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:56,338 INFO L225 Difference]: With dead ends: 426 [2018-01-23 14:32:56,338 INFO L226 Difference]: Without dead ends: 226 [2018-01-23 14:32:56,339 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:32:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-23 14:32:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-01-23 14:32:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-23 14:32:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 243 transitions. [2018-01-23 14:32:56,354 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 243 transitions. Word has length 72 [2018-01-23 14:32:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:56,354 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 243 transitions. [2018-01-23 14:32:56,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:32:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 243 transitions. [2018-01-23 14:32:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-23 14:32:56,356 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:32:56,356 INFO L322 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:32:56,356 INFO L371 AbstractCegarLoop]: === Iteration 9 === [appendErr0EnsuresViolation]=== [2018-01-23 14:32:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash 411383056, now seen corresponding path program 1 times [2018-01-23 14:32:56,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:32:56,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:32:56,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:56,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:32:56,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:32:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:32:56,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:32:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-23 14:32:56,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:32:56,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:32:56,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:32:56,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:32:56,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:32:56,479 INFO L87 Difference]: Start difference. First operand 224 states and 243 transitions. Second operand 6 states. [2018-01-23 14:32:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:32:56,572 INFO L93 Difference]: Finished difference Result 397 states and 430 transitions. [2018-01-23 14:32:56,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:32:56,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-01-23 14:32:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:32:56,573 INFO L225 Difference]: With dead ends: 397 [2018-01-23 14:32:56,573 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:32:56,574 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:32:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:32:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:32:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:32:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:32:56,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2018-01-23 14:32:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:32:56,575 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:32:56,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:32:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:32:56,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:32:56,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:32:56 BoogieIcfgContainer [2018-01-23 14:32:56,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:32:56,579 INFO L168 Benchmark]: Toolchain (without parser) took 6641.78 ms. Allocated memory was 308.3 MB in the beginning and 563.1 MB in the end (delta: 254.8 MB). Free memory was 265.2 MB in the beginning and 413.6 MB in the end (delta: -148.4 MB). Peak memory consumption was 106.4 MB. Max. memory is 5.3 GB. [2018-01-23 14:32:56,581 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 308.3 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:32:56,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.53 ms. Allocated memory is still 308.3 MB. Free memory was 265.2 MB in the beginning and 253.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:32:56,581 INFO L168 Benchmark]: Boogie Preprocessor took 47.65 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:32:56,581 INFO L168 Benchmark]: RCFGBuilder took 577.40 ms. Allocated memory is still 308.3 MB. Free memory was 251.3 MB in the beginning and 216.3 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:32:56,582 INFO L168 Benchmark]: TraceAbstraction took 5770.62 ms. Allocated memory was 308.3 MB in the beginning and 563.1 MB in the end (delta: 254.8 MB). Free memory was 216.3 MB in the beginning and 413.6 MB in the end (delta: -197.3 MB). Peak memory consumption was 57.5 MB. Max. memory is 5.3 GB. [2018-01-23 14:32:56,584 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.13 ms. Allocated memory is still 308.3 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.53 ms. Allocated memory is still 308.3 MB. Free memory was 265.2 MB in the beginning and 253.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.65 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 577.40 ms. Allocated memory is still 308.3 MB. Free memory was 251.3 MB in the beginning and 216.3 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5770.62 ms. Allocated memory was 308.3 MB in the beginning and 563.1 MB in the end (delta: 254.8 MB). Free memory was 216.3 MB in the beginning and 413.6 MB in the end (delta: -197.3 MB). Peak memory consumption was 57.5 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 540]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L586] FCALL struct node_t *list = ((void *)0); VAL [list={98:0}] [L587] int dataNotFinished = 0; VAL [dataNotFinished=0, list={98:0}] [L589] CALL append(&list) VAL [pointerToList={98:0}] [L576] EXPR, FCALL malloc(sizeof *node) VAL [malloc(sizeof *node)={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L576] struct node_t *node = malloc(sizeof *node); VAL [malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L577] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L577] FCALL node->next = *pointerToList VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L578] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) VAL [prevData={0:0}] [L541] prevData != ((void *)0) && prevData->hasNextPartReference VAL [prevData={0:0}, prevData={0:0}, prevData != ((void *)0) && prevData->hasNextPartReference=0] [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) VAL [malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L544] Data data = malloc(sizeof *data); VAL [data={91:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) VAL [data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) VAL [data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L546] int counter = 0; [L547] counter = 0 VAL [counter=0, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND TRUE counter < 3 VAL [counter=0, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] EXPR, FCALL data->array VAL [counter=0, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, counter=0, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] counter++ VAL [counter=1, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND TRUE counter < 3 VAL [counter=1, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] EXPR, FCALL data->array VAL [counter=1, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, counter=1, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] counter++ VAL [counter=2, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND TRUE counter < 3 VAL [counter=2, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] EXPR, FCALL data->array VAL [counter=2, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, counter=2, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] counter++ VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND FALSE !(counter < 3) VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L550] FCALL data->number = 0 VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [__VERIFIER_nondet_int()=0, __VERIFIER_nondet_int() && data->number < 200=0, counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=200] [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [__VERIFIER_nondet_int()=0, __VERIFIER_nondet_int() && data->number < 200=0, __VERIFIER_nondet_int() && data->number < 200 && data->number > -200=0, counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=200] [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=200] [L557] FCALL data->nextData = ((void *)0) VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=200] [L558] COND FALSE !(__VERIFIER_nondet_int()) [L569] return data; VAL [\result={91:0}, counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=200] - StatisticsResult: Ultimate Automizer benchmark data for error location: create_dataErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. UNSAFE Result, 1.6s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 665 SDtfs, 90 SDslu, 1044 SDs, 0 SdLazy, 73 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 21657 SizeOfPredicates, 2 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 0/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 571]: 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: freeDataErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. SAFE Result, 0.4s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 661 SDtfs, 69 SDslu, 607 SDs, 0 SdLazy, 53 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 20021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - 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 6 procedures, 130 locations, 6 error locations. UNSAFE Result, 0.0s 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=130occurred 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, 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, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: 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: ULTIMATE.startErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. SAFE Result, 0.3s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 679 SDtfs, 121 SDslu, 507 SDs, 0 SdLazy, 49 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 16429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 585]: 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 6 procedures, 130 locations, 6 error locations. SAFE Result, 0.4s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 673 SDtfs, 121 SDslu, 501 SDs, 0 SdLazy, 49 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 15341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 575]: 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: appendErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. SAFE Result, 2.8s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 993 SDtfs, 277 SDslu, 1943 SDs, 0 SdLazy, 450 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 76 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 601 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 590 ConstructedInterpolants, 42 QuantifiedInterpolants, 108728 SizeOfPredicates, 4 NumberOfNonLiveVariables, 370 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 92/107 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-32-56-594.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-32-56-594.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-32-56-594.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-32-56-594.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-32-56-594.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-23_14-32-56-594.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-23_14-32-56-594.csv Received shutdown request...