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_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:07:15,697 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:07:15,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:07:15,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:07:15,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:07:15,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:07:15,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:07:15,717 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:07:15,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:07:15,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:07:15,721 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:07:15,721 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:07:15,722 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:07:15,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:07:15,724 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:07:15,727 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:07:15,729 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:07:15,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:07:15,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:07:15,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:07:15,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:07:15,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:07:15,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:07:15,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:07:15,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:07:15,741 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:07:15,741 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:07:15,742 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:07:15,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:07:15,742 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:07:15,743 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:07:15,743 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-20 22:07:15,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:07:15,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:07:15,757 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:07:15,757 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:07:15,757 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:07:15,758 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:07:15,758 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:07:15,759 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:07:15,759 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:07:15,759 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:07:15,759 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:07:15,760 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:07:15,760 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:07:15,760 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:07:15,760 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:07:15,760 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:07:15,761 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:07:15,761 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:07:15,761 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:07:15,761 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:07:15,761 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:07:15,762 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:07:15,762 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:07:15,762 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:07:15,762 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:07:15,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:07:15,763 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:07:15,763 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:07:15,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:07:15,763 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:07:15,764 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:07:15,764 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:07:15,764 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:07:15,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:07:15,764 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:07:15,765 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:07:15,766 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:07:15,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:07:15,815 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:07:15,842 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:07:15,843 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:07:15,844 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:07:15,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_true-valid-memsafety.i [2018-01-20 22:07:16,028 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:07:16,031 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:07:16,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:07:16,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:07:16,037 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:07:16,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:07:16" (1/1) ... [2018-01-20 22:07:16,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50990cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16, skipping insertion in model container [2018-01-20 22:07:16,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:07:16" (1/1) ... [2018-01-20 22:07:16,058 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:07:16,098 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:07:16,224 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:07:16,253 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:07:16,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16 WrapperNode [2018-01-20 22:07:16,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:07:16,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:07:16,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:07:16,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:07:16,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16" (1/1) ... [2018-01-20 22:07:16,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16" (1/1) ... [2018-01-20 22:07:16,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16" (1/1) ... [2018-01-20 22:07:16,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16" (1/1) ... [2018-01-20 22:07:16,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16" (1/1) ... [2018-01-20 22:07:16,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16" (1/1) ... [2018-01-20 22:07:16,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16" (1/1) ... [2018-01-20 22:07:16,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:07:16,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:07:16,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:07:16,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:07:16,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16" (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-20 22:07:16,357 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:07:16,358 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:07:16,358 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-20 22:07:16,358 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-20 22:07:16,358 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-20 22:07:16,358 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:07:16,358 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:07:16,358 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:07:16,358 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:07:16,359 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:07:16,359 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:07:16,359 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:07:16,359 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:07:16,359 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:07:16,359 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:07:16,359 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:07:16,359 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-20 22:07:16,359 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-20 22:07:16,359 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-20 22:07:16,360 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:07:16,360 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:07:16,360 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:07:16,817 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:07:16,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:07:16 BoogieIcfgContainer [2018-01-20 22:07:16,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:07:16,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:07:16,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:07:16,822 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:07:16,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:07:16" (1/3) ... [2018-01-20 22:07:16,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5496367d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:07:16, skipping insertion in model container [2018-01-20 22:07:16,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:16" (2/3) ... [2018-01-20 22:07:16,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5496367d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:07:16, skipping insertion in model container [2018-01-20 22:07:16,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:07:16" (3/3) ... [2018-01-20 22:07:16,826 INFO L105 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_true-valid-memsafety.i [2018-01-20 22:07:16,836 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:07:16,844 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-20 22:07:16,894 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:16,894 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:16,894 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:16,895 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:16,895 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:16,895 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:16,895 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:16,895 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_dataErr0EnsuresViolation======== [2018-01-20 22:07:16,896 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-20 22:07:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 22:07:16,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:16,922 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-20 22:07:16,922 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0EnsuresViolation]=== [2018-01-20 22:07:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash 15807653, now seen corresponding path program 1 times [2018-01-20 22:07:16,927 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:16,927 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:16,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:16,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:16,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:17,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:17,121 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-20 22:07:17,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:17,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:17,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:17,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:17,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:17,218 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2018-01-20 22:07:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:17,267 INFO L93 Difference]: Finished difference Result 254 states and 292 transitions. [2018-01-20 22:07:17,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:17,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-20 22:07:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:17,279 INFO L225 Difference]: With dead ends: 254 [2018-01-20 22:07:17,279 INFO L226 Difference]: Without dead ends: 99 [2018-01-20 22:07:17,284 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-20 22:07:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-20 22:07:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-20 22:07:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-20 22:07:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-01-20 22:07:17,324 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 25 [2018-01-20 22:07:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:17,325 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-01-20 22:07:17,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-01-20 22:07:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 22:07:17,327 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:17,327 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-20 22:07:17,327 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0EnsuresViolation]=== [2018-01-20 22:07:17,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1450780190, now seen corresponding path program 1 times [2018-01-20 22:07:17,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:17,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:17,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:17,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:17,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:17,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:17,429 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-20 22:07:17,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:17,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:07:17,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:07:17,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:07:17,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:07:17,432 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 4 states. [2018-01-20 22:07:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:17,477 INFO L93 Difference]: Finished difference Result 243 states and 272 transitions. [2018-01-20 22:07:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:07:17,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-20 22:07:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:17,479 INFO L225 Difference]: With dead ends: 243 [2018-01-20 22:07:17,479 INFO L226 Difference]: Without dead ends: 152 [2018-01-20 22:07:17,481 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-20 22:07:17,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-20 22:07:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-01-20 22:07:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-20 22:07:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2018-01-20 22:07:17,490 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 27 [2018-01-20 22:07:17,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:17,491 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2018-01-20 22:07:17,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:07:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2018-01-20 22:07:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 22:07:17,492 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:17,492 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-20 22:07:17,492 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0EnsuresViolation]=== [2018-01-20 22:07:17,492 INFO L82 PathProgramCache]: Analyzing trace with hash 300506494, now seen corresponding path program 1 times [2018-01-20 22:07:17,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:17,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:17,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:17,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:17,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:17,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:17,551 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-20 22:07:17,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:17,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:07:17,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:17,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:17,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:17,553 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand 3 states. [2018-01-20 22:07:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:17,607 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2018-01-20 22:07:17,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:17,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-20 22:07:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:17,610 INFO L225 Difference]: With dead ends: 153 [2018-01-20 22:07:17,610 INFO L226 Difference]: Without dead ends: 152 [2018-01-20 22:07:17,610 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-20 22:07:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-20 22:07:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-01-20 22:07:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-20 22:07:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-01-20 22:07:17,622 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 29 [2018-01-20 22:07:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:17,623 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-01-20 22:07:17,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-01-20 22:07:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-20 22:07:17,625 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:17,625 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] [2018-01-20 22:07:17,625 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0EnsuresViolation]=== [2018-01-20 22:07:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1126752096, now seen corresponding path program 1 times [2018-01-20 22:07:17,626 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:17,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:17,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:17,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:17,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:17,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:17,694 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-20 22:07:17,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:17,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:17,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:17,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:17,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:17,696 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 3 states. [2018-01-20 22:07:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:17,731 INFO L93 Difference]: Finished difference Result 310 states and 347 transitions. [2018-01-20 22:07:17,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:17,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-01-20 22:07:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:17,734 INFO L225 Difference]: With dead ends: 310 [2018-01-20 22:07:17,734 INFO L226 Difference]: Without dead ends: 166 [2018-01-20 22:07:17,735 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-20 22:07:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-20 22:07:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2018-01-20 22:07:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-20 22:07:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2018-01-20 22:07:17,748 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 45 [2018-01-20 22:07:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:17,749 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2018-01-20 22:07:17,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2018-01-20 22:07:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-20 22:07:17,751 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:17,751 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] [2018-01-20 22:07:17,751 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0EnsuresViolation]=== [2018-01-20 22:07:17,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1796279385, now seen corresponding path program 1 times [2018-01-20 22:07:17,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:17,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:17,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:17,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:17,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:17,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:17,827 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-20 22:07:17,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:17,828 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-20 22:07:17,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:17,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:17,947 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-20 22:07:17,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:17,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-20 22:07:17,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:07:17,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:07:17,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:07:17,976 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand 5 states. [2018-01-20 22:07:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:17,997 INFO L93 Difference]: Finished difference Result 328 states and 365 transitions. [2018-01-20 22:07:17,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:17,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-01-20 22:07:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:17,999 INFO L225 Difference]: With dead ends: 328 [2018-01-20 22:07:17,999 INFO L226 Difference]: Without dead ends: 180 [2018-01-20 22:07:18,000 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-20 22:07:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-20 22:07:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 170. [2018-01-20 22:07:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-20 22:07:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2018-01-20 22:07:18,013 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 52 [2018-01-20 22:07:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:18,013 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2018-01-20 22:07:18,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:07:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2018-01-20 22:07:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-20 22:07:18,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:18,015 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] [2018-01-20 22:07:18,015 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0EnsuresViolation]=== [2018-01-20 22:07:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1063113088, now seen corresponding path program 2 times [2018-01-20 22:07:18,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:18,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:18,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:18,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:18,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:18,124 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-20 22:07:18,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:18,124 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-20 22:07:18,135 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:07:18,167 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:18,194 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:18,196 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:18,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:18,218 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-20 22:07:18,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:18,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-20 22:07:18,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:07:18,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:07:18,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:07:18,252 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand 6 states. [2018-01-20 22:07:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:18,297 INFO L93 Difference]: Finished difference Result 346 states and 383 transitions. [2018-01-20 22:07:18,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:07:18,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-01-20 22:07:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:18,299 INFO L225 Difference]: With dead ends: 346 [2018-01-20 22:07:18,299 INFO L226 Difference]: Without dead ends: 184 [2018-01-20 22:07:18,311 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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-20 22:07:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-20 22:07:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-01-20 22:07:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-20 22:07:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 200 transitions. [2018-01-20 22:07:18,322 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 200 transitions. Word has length 59 [2018-01-20 22:07:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:18,322 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 200 transitions. [2018-01-20 22:07:18,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:07:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 200 transitions. [2018-01-20 22:07:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-20 22:07:18,324 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:18,325 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] [2018-01-20 22:07:18,328 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0EnsuresViolation]=== [2018-01-20 22:07:18,329 INFO L82 PathProgramCache]: Analyzing trace with hash 248208775, now seen corresponding path program 3 times [2018-01-20 22:07:18,329 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:18,329 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:18,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,330 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:18,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:07:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:07:18,437 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:07:18,456 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:07:18,470 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:07:18,494 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:18,494 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:18,494 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:18,494 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:18,494 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:18,494 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:18,495 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:18,495 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == freeDataErr0EnsuresViolation======== [2018-01-20 22:07:18,495 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-20 22:07:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 22:07:18,498 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:18,498 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-20 22:07:18,498 INFO L371 AbstractCegarLoop]: === Iteration 1 === [freeDataErr0EnsuresViolation]=== [2018-01-20 22:07:18,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1728587143, now seen corresponding path program 1 times [2018-01-20 22:07:18,499 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:18,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:18,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:18,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:18,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:18,509 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-20 22:07:18,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:18,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:07:18,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:07:18,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:07:18,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:07:18,510 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2018-01-20 22:07:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:18,515 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2018-01-20 22:07:18,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:07:18,515 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-20 22:07:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:18,516 INFO L225 Difference]: With dead ends: 253 [2018-01-20 22:07:18,516 INFO L226 Difference]: Without dead ends: 119 [2018-01-20 22:07:18,516 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-20 22:07:18,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-20 22:07:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-20 22:07:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-20 22:07:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-01-20 22:07:18,521 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 24 [2018-01-20 22:07:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:18,521 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-01-20 22:07:18,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:07:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-01-20 22:07:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-20 22:07:18,522 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:18,522 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-20 22:07:18,522 INFO L371 AbstractCegarLoop]: === Iteration 2 === [freeDataErr0EnsuresViolation]=== [2018-01-20 22:07:18,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1665239383, now seen corresponding path program 1 times [2018-01-20 22:07:18,522 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:18,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:18,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:18,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:18,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:18,554 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-20 22:07:18,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:18,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:18,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:18,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:18,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:18,555 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 3 states. [2018-01-20 22:07:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:18,565 INFO L93 Difference]: Finished difference Result 231 states and 259 transitions. [2018-01-20 22:07:18,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:18,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-20 22:07:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:18,567 INFO L225 Difference]: With dead ends: 231 [2018-01-20 22:07:18,567 INFO L226 Difference]: Without dead ends: 120 [2018-01-20 22:07:18,568 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-20 22:07:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-20 22:07:18,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-20 22:07:18,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-20 22:07:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-01-20 22:07:18,572 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 54 [2018-01-20 22:07:18,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:18,573 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-01-20 22:07:18,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-01-20 22:07:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-20 22:07:18,574 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:18,574 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-20 22:07:18,574 INFO L371 AbstractCegarLoop]: === Iteration 3 === [freeDataErr0EnsuresViolation]=== [2018-01-20 22:07:18,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1275844236, now seen corresponding path program 1 times [2018-01-20 22:07:18,574 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:18,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:18,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:18,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:18,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:18,648 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-20 22:07:18,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:18,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:07:18,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:07:18,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:07:18,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:07:18,649 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 4 states. [2018-01-20 22:07:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:18,693 INFO L93 Difference]: Finished difference Result 281 states and 312 transitions. [2018-01-20 22:07:18,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:18,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-20 22:07:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:18,697 INFO L225 Difference]: With dead ends: 281 [2018-01-20 22:07:18,698 INFO L226 Difference]: Without dead ends: 169 [2018-01-20 22:07:18,699 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-20 22:07:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-20 22:07:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-01-20 22:07:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-20 22:07:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 186 transitions. [2018-01-20 22:07:18,708 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 186 transitions. Word has length 56 [2018-01-20 22:07:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:18,708 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 186 transitions. [2018-01-20 22:07:18,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:07:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2018-01-20 22:07:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 22:07:18,711 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:18,711 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-20 22:07:18,711 INFO L371 AbstractCegarLoop]: === Iteration 4 === [freeDataErr0EnsuresViolation]=== [2018-01-20 22:07:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -712820142, now seen corresponding path program 1 times [2018-01-20 22:07:18,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:18,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:18,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:18,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:18,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:18,747 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-20 22:07:18,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:18,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:18,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:18,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:18,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:18,748 INFO L87 Difference]: Start difference. First operand 169 states and 186 transitions. Second operand 3 states. [2018-01-20 22:07:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:18,772 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2018-01-20 22:07:18,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:18,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-01-20 22:07:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:18,774 INFO L225 Difference]: With dead ends: 192 [2018-01-20 22:07:18,774 INFO L226 Difference]: Without dead ends: 170 [2018-01-20 22:07:18,774 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-20 22:07:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-20 22:07:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-01-20 22:07:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-20 22:07:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2018-01-20 22:07:18,780 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 58 [2018-01-20 22:07:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:18,780 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2018-01-20 22:07:18,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2018-01-20 22:07:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 22:07:18,781 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:18,781 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-20 22:07:18,782 INFO L371 AbstractCegarLoop]: === Iteration 5 === [freeDataErr0EnsuresViolation]=== [2018-01-20 22:07:18,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1993799252, now seen corresponding path program 1 times [2018-01-20 22:07:18,782 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:18,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:18,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:18,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:18,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:18,834 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-20 22:07:18,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:18,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:07:18,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:07:18,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:07:18,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:07:18,835 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 4 states. [2018-01-20 22:07:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:18,928 INFO L93 Difference]: Finished difference Result 297 states and 329 transitions. [2018-01-20 22:07:18,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:18,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-01-20 22:07:18,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:18,929 INFO L225 Difference]: With dead ends: 297 [2018-01-20 22:07:18,929 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:07:18,931 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-20 22:07:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:07:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:07:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:07:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:07:18,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-01-20 22:07:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:18,932 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:07:18,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:07:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:07:18,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:07:18,935 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:18,935 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:18,936 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:18,936 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:18,936 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:18,936 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:18,936 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:18,936 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:07:18,936 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-20 22:07:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:07:18,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:18,938 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:07:18,938 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:07:18,939 INFO L82 PathProgramCache]: Analyzing trace with hash 243161, now seen corresponding path program 1 times [2018-01-20 22:07:18,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:18,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:18,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:18,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:07:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:07:18,944 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:07:18,945 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:07:18,947 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:18,947 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:18,947 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:18,947 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:18,948 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:18,948 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:18,948 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:18,948 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:07:18,948 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-20 22:07:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-20 22:07:18,950 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:18,950 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:07:18,950 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1734261875, now seen corresponding path program 1 times [2018-01-20 22:07:18,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:18,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:18,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:18,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:18,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:18,960 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-20 22:07:18,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:18,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:07:18,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:07:18,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:07:18,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:07:18,961 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2018-01-20 22:07:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:18,968 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2018-01-20 22:07:18,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:07:18,968 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-20 22:07:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:18,969 INFO L225 Difference]: With dead ends: 253 [2018-01-20 22:07:18,969 INFO L226 Difference]: Without dead ends: 125 [2018-01-20 22:07:18,970 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-20 22:07:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-20 22:07:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-20 22:07:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-20 22:07:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-20 22:07:18,975 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 16 [2018-01-20 22:07:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:18,976 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-20 22:07:18,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:07:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-20 22:07:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 22:07:18,977 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:18,977 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-20 22:07:18,977 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash 433974604, now seen corresponding path program 1 times [2018-01-20 22:07:18,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:18,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:18,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:18,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:18,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,001 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-20 22:07:19,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:19,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:19,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:19,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:19,003 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 3 states. [2018-01-20 22:07:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,016 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2018-01-20 22:07:19,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:19,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-20 22:07:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,018 INFO L225 Difference]: With dead ends: 243 [2018-01-20 22:07:19,018 INFO L226 Difference]: Without dead ends: 126 [2018-01-20 22:07:19,019 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-20 22:07:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-20 22:07:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-20 22:07:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-20 22:07:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-01-20 22:07:19,024 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 48 [2018-01-20 22:07:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,025 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-01-20 22:07:19,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-01-20 22:07:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-20 22:07:19,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,026 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-20 22:07:19,026 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1491225745, now seen corresponding path program 1 times [2018-01-20 22:07:19,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,082 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-20 22:07:19,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:07:19,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:07:19,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:07:19,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:07:19,084 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 4 states. [2018-01-20 22:07:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,106 INFO L93 Difference]: Finished difference Result 293 states and 324 transitions. [2018-01-20 22:07:19,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:19,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-20 22:07:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,109 INFO L225 Difference]: With dead ends: 293 [2018-01-20 22:07:19,109 INFO L226 Difference]: Without dead ends: 175 [2018-01-20 22:07:19,110 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-20 22:07:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-20 22:07:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-01-20 22:07:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-20 22:07:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 192 transitions. [2018-01-20 22:07:19,119 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 192 transitions. Word has length 50 [2018-01-20 22:07:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,120 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 192 transitions. [2018-01-20 22:07:19,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:07:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 192 transitions. [2018-01-20 22:07:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-20 22:07:19,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,122 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-20 22:07:19,122 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash -406527051, now seen corresponding path program 1 times [2018-01-20 22:07:19,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,159 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-20 22:07:19,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:19,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:19,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:19,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:19,161 INFO L87 Difference]: Start difference. First operand 175 states and 192 transitions. Second operand 3 states. [2018-01-20 22:07:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,183 INFO L93 Difference]: Finished difference Result 204 states and 222 transitions. [2018-01-20 22:07:19,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:19,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-01-20 22:07:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,186 INFO L225 Difference]: With dead ends: 204 [2018-01-20 22:07:19,186 INFO L226 Difference]: Without dead ends: 176 [2018-01-20 22:07:19,186 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-20 22:07:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-20 22:07:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-01-20 22:07:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-20 22:07:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2018-01-20 22:07:19,197 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 52 [2018-01-20 22:07:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,197 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2018-01-20 22:07:19,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2018-01-20 22:07:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-20 22:07:19,199 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,199 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-20 22:07:19,199 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:19,199 INFO L82 PathProgramCache]: Analyzing trace with hash 294537527, now seen corresponding path program 1 times [2018-01-20 22:07:19,199 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,265 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-20 22:07:19,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:07:19,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:07:19,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:07:19,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:07:19,266 INFO L87 Difference]: Start difference. First operand 176 states and 193 transitions. Second operand 4 states. [2018-01-20 22:07:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,330 INFO L93 Difference]: Finished difference Result 303 states and 335 transitions. [2018-01-20 22:07:19,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:19,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-01-20 22:07:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,331 INFO L225 Difference]: With dead ends: 303 [2018-01-20 22:07:19,332 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:07:19,333 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-20 22:07:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:07:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:07:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:07:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:07:19,334 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-01-20 22:07:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,334 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:07:19,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:07:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:07:19,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:07:19,336 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:19,336 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:19,336 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:19,336 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:19,336 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:19,336 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:19,336 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:19,336 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:07:19,337 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-20 22:07:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-20 22:07:19,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,339 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:07:19,339 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:07:19,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1820797042, now seen corresponding path program 1 times [2018-01-20 22:07:19,339 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,348 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-20 22:07:19,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:07:19,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:07:19,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:07:19,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:07:19,350 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2018-01-20 22:07:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,356 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2018-01-20 22:07:19,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:07:19,357 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-20 22:07:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,358 INFO L225 Difference]: With dead ends: 253 [2018-01-20 22:07:19,358 INFO L226 Difference]: Without dead ends: 123 [2018-01-20 22:07:19,358 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-20 22:07:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-20 22:07:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-20 22:07:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-20 22:07:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-01-20 22:07:19,365 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 14 [2018-01-20 22:07:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,365 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-01-20 22:07:19,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:07:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-01-20 22:07:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 22:07:19,366 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,366 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-20 22:07:19,366 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:07:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash -821893875, now seen corresponding path program 1 times [2018-01-20 22:07:19,367 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,367 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,393 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-20 22:07:19,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:19,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:19,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:19,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:19,394 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 3 states. [2018-01-20 22:07:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,407 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2018-01-20 22:07:19,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:19,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-20 22:07:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,409 INFO L225 Difference]: With dead ends: 239 [2018-01-20 22:07:19,409 INFO L226 Difference]: Without dead ends: 124 [2018-01-20 22:07:19,410 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-20 22:07:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-20 22:07:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-20 22:07:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-20 22:07:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-20 22:07:19,416 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 46 [2018-01-20 22:07:19,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,416 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-20 22:07:19,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-20 22:07:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 22:07:19,417 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,418 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-20 22:07:19,418 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:07:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash 78895088, now seen corresponding path program 1 times [2018-01-20 22:07:19,418 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,418 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,466 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-20 22:07:19,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:07:19,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:07:19,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:07:19,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:07:19,467 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 4 states. [2018-01-20 22:07:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,488 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2018-01-20 22:07:19,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:19,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-20 22:07:19,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,490 INFO L225 Difference]: With dead ends: 289 [2018-01-20 22:07:19,490 INFO L226 Difference]: Without dead ends: 173 [2018-01-20 22:07:19,491 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-20 22:07:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-20 22:07:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-01-20 22:07:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-20 22:07:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-01-20 22:07:19,500 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 48 [2018-01-20 22:07:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,500 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-01-20 22:07:19,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:07:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-01-20 22:07:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-20 22:07:19,501 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,501 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-20 22:07:19,502 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:07:19,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2083102282, now seen corresponding path program 1 times [2018-01-20 22:07:19,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,536 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-20 22:07:19,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:19,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:19,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:19,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:19,537 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 3 states. [2018-01-20 22:07:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,549 INFO L93 Difference]: Finished difference Result 200 states and 218 transitions. [2018-01-20 22:07:19,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:19,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-01-20 22:07:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,551 INFO L225 Difference]: With dead ends: 200 [2018-01-20 22:07:19,551 INFO L226 Difference]: Without dead ends: 174 [2018-01-20 22:07:19,551 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-20 22:07:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-20 22:07:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-01-20 22:07:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-20 22:07:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-01-20 22:07:19,559 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 50 [2018-01-20 22:07:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,559 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2018-01-20 22:07:19,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2018-01-20 22:07:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-20 22:07:19,561 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,561 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-20 22:07:19,561 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:07:19,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1403043912, now seen corresponding path program 1 times [2018-01-20 22:07:19,561 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,608 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-20 22:07:19,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:07:19,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:07:19,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:07:19,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:07:19,610 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 4 states. [2018-01-20 22:07:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,655 INFO L93 Difference]: Finished difference Result 301 states and 333 transitions. [2018-01-20 22:07:19,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:19,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-20 22:07:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,657 INFO L225 Difference]: With dead ends: 301 [2018-01-20 22:07:19,657 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:07:19,658 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-20 22:07:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:07:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:07:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:07:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:07:19,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-01-20 22:07:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,659 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:07:19,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:07:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:07:19,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:07:19,661 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:19,661 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:19,661 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:19,661 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:19,661 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:19,661 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:19,661 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:19,662 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-20 22:07:19,662 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-20 22:07:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 22:07:19,664 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,664 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-20 22:07:19,664 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:19,665 INFO L82 PathProgramCache]: Analyzing trace with hash -837690628, now seen corresponding path program 1 times [2018-01-20 22:07:19,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,697 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-20 22:07:19,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:19,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:19,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:19,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:19,698 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2018-01-20 22:07:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,712 INFO L93 Difference]: Finished difference Result 254 states and 292 transitions. [2018-01-20 22:07:19,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:19,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-20 22:07:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,714 INFO L225 Difference]: With dead ends: 254 [2018-01-20 22:07:19,714 INFO L226 Difference]: Without dead ends: 99 [2018-01-20 22:07:19,714 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-20 22:07:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-20 22:07:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-20 22:07:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-20 22:07:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-01-20 22:07:19,719 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 30 [2018-01-20 22:07:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,719 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-01-20 22:07:19,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-01-20 22:07:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 22:07:19,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,720 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-20 22:07:19,720 INFO L371 AbstractCegarLoop]: === Iteration 2 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash 844297183, now seen corresponding path program 1 times [2018-01-20 22:07:19,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:19,769 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-20 22:07:19,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:19,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:07:19,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:07:19,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:07:19,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:07:19,770 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 4 states. [2018-01-20 22:07:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:19,790 INFO L93 Difference]: Finished difference Result 239 states and 268 transitions. [2018-01-20 22:07:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:19,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-20 22:07:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:19,791 INFO L225 Difference]: With dead ends: 239 [2018-01-20 22:07:19,792 INFO L226 Difference]: Without dead ends: 148 [2018-01-20 22:07:19,792 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-20 22:07:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-20 22:07:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-01-20 22:07:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-20 22:07:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2018-01-20 22:07:19,799 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 32 [2018-01-20 22:07:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:19,799 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2018-01-20 22:07:19,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:07:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2018-01-20 22:07:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 22:07:19,800 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:19,800 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-20 22:07:19,800 INFO L371 AbstractCegarLoop]: === Iteration 3 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:19,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1281214885, now seen corresponding path program 1 times [2018-01-20 22:07:19,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:19,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:19,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:19,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:19,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:20,070 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-20 22:07:20,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:20,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-20 22:07:20,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 22:07:20,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 22:07:20,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-20 22:07:20,071 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 10 states. [2018-01-20 22:07:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:20,513 INFO L93 Difference]: Finished difference Result 301 states and 337 transitions. [2018-01-20 22:07:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-20 22:07:20,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-20 22:07:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:20,515 INFO L225 Difference]: With dead ends: 301 [2018-01-20 22:07:20,515 INFO L226 Difference]: Without dead ends: 161 [2018-01-20 22:07:20,516 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-01-20 22:07:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-20 22:07:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2018-01-20 22:07:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-20 22:07:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2018-01-20 22:07:20,524 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 34 [2018-01-20 22:07:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:20,524 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2018-01-20 22:07:20,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 22:07:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2018-01-20 22:07:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-20 22:07:20,525 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:20,526 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-20 22:07:20,526 INFO L371 AbstractCegarLoop]: === Iteration 4 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1389449951, now seen corresponding path program 1 times [2018-01-20 22:07:20,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:20,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:20,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:20,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:20,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:20,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:20,566 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-20 22:07:20,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:20,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:20,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:20,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:20,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:20,567 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand 3 states. [2018-01-20 22:07:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:20,592 INFO L93 Difference]: Finished difference Result 312 states and 352 transitions. [2018-01-20 22:07:20,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:20,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-01-20 22:07:20,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:20,593 INFO L225 Difference]: With dead ends: 312 [2018-01-20 22:07:20,593 INFO L226 Difference]: Without dead ends: 172 [2018-01-20 22:07:20,594 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-20 22:07:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-20 22:07:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2018-01-20 22:07:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-20 22:07:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2018-01-20 22:07:20,600 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 50 [2018-01-20 22:07:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:20,600 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2018-01-20 22:07:20,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2018-01-20 22:07:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-20 22:07:20,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:20,601 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, 1] [2018-01-20 22:07:20,601 INFO L371 AbstractCegarLoop]: === Iteration 5 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash 557657402, now seen corresponding path program 1 times [2018-01-20 22:07:20,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:20,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:20,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:20,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:20,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:20,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:20,645 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-20 22:07:20,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:20,646 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-20 22:07:20,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:20,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:20,804 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-20 22:07:20,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:20,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-20 22:07:20,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:07:20,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:07:20,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:07:20,842 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand 5 states. [2018-01-20 22:07:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:20,883 INFO L93 Difference]: Finished difference Result 330 states and 370 transitions. [2018-01-20 22:07:20,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:20,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-01-20 22:07:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:20,884 INFO L225 Difference]: With dead ends: 330 [2018-01-20 22:07:20,884 INFO L226 Difference]: Without dead ends: 186 [2018-01-20 22:07:20,885 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:07:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-20 22:07:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 176. [2018-01-20 22:07:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-20 22:07:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2018-01-20 22:07:20,891 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 57 [2018-01-20 22:07:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:20,891 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2018-01-20 22:07:20,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:07:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2018-01-20 22:07:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-20 22:07:20,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:20,892 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, 1] [2018-01-20 22:07:20,892 INFO L371 AbstractCegarLoop]: === Iteration 6 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:20,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1557925633, now seen corresponding path program 2 times [2018-01-20 22:07:20,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:20,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:20,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:20,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:20,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:20,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:20,958 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-20 22:07:20,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:20,958 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-20 22:07:20,964 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:07:20,986 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:20,999 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:21,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:21,097 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-20 22:07:21,133 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-20 22:07:21,146 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-20 22:07:21,207 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-20 22:07:21,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:07:21,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-01-20 22:07:21,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:07:21,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:07:21,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=21, Unknown=3, NotChecked=30, Total=72 [2018-01-20 22:07:21,229 INFO L87 Difference]: Start difference. First operand 176 states and 193 transitions. Second operand 9 states. [2018-01-20 22:07:21,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:21,489 INFO L93 Difference]: Finished difference Result 387 states and 435 transitions. [2018-01-20 22:07:21,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:07:21,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-01-20 22:07:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:21,491 INFO L225 Difference]: With dead ends: 387 [2018-01-20 22:07:21,491 INFO L226 Difference]: Without dead ends: 225 [2018-01-20 22:07:21,492 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=42, Unknown=9, NotChecked=48, Total=132 [2018-01-20 22:07:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-20 22:07:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2018-01-20 22:07:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-20 22:07:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2018-01-20 22:07:21,503 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 64 [2018-01-20 22:07:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:21,503 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2018-01-20 22:07:21,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:07:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2018-01-20 22:07:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-20 22:07:21,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:21,504 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] [2018-01-20 22:07:21,504 INFO L371 AbstractCegarLoop]: === Iteration 7 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:21,505 INFO L82 PathProgramCache]: Analyzing trace with hash 922982711, now seen corresponding path program 1 times [2018-01-20 22:07:21,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:21,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:21,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:21,505 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:21,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:21,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:21,632 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-20 22:07:21,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:21,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 22:07:21,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:07:21,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:07:21,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:07:21,634 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand 6 states. [2018-01-20 22:07:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:21,941 INFO L93 Difference]: Finished difference Result 460 states and 519 transitions. [2018-01-20 22:07:21,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:07:21,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-01-20 22:07:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:21,942 INFO L225 Difference]: With dead ends: 460 [2018-01-20 22:07:21,942 INFO L226 Difference]: Without dead ends: 264 [2018-01-20 22:07:21,943 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-20 22:07:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-20 22:07:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 222. [2018-01-20 22:07:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-20 22:07:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 245 transitions. [2018-01-20 22:07:21,954 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 245 transitions. Word has length 73 [2018-01-20 22:07:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:21,955 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 245 transitions. [2018-01-20 22:07:21,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:07:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 245 transitions. [2018-01-20 22:07:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-20 22:07:21,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:21,956 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] [2018-01-20 22:07:21,956 INFO L371 AbstractCegarLoop]: === Iteration 8 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1270628311, now seen corresponding path program 1 times [2018-01-20 22:07:21,956 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:21,956 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:21,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:21,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:21,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:21,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:22,002 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-20 22:07:22,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:22,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:07:22,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:07:22,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:07:22,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:07:22,003 INFO L87 Difference]: Start difference. First operand 222 states and 245 transitions. Second operand 4 states. [2018-01-20 22:07:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:22,115 INFO L93 Difference]: Finished difference Result 434 states and 490 transitions. [2018-01-20 22:07:22,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:07:22,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-01-20 22:07:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:22,117 INFO L225 Difference]: With dead ends: 434 [2018-01-20 22:07:22,118 INFO L226 Difference]: Without dead ends: 230 [2018-01-20 22:07:22,118 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-20 22:07:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-20 22:07:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-01-20 22:07:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-20 22:07:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 247 transitions. [2018-01-20 22:07:22,128 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 247 transitions. Word has length 73 [2018-01-20 22:07:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:22,128 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 247 transitions. [2018-01-20 22:07:22,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:07:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2018-01-20 22:07:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-20 22:07:22,129 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:22,129 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, 1] [2018-01-20 22:07:22,129 INFO L371 AbstractCegarLoop]: === Iteration 9 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:22,130 INFO L82 PathProgramCache]: Analyzing trace with hash -763042188, now seen corresponding path program 1 times [2018-01-20 22:07:22,130 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:22,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:22,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:22,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:22,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:22,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:22,293 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-20 22:07:22,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:22,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 22:07:22,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:07:22,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:07:22,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:07:22,294 INFO L87 Difference]: Start difference. First operand 228 states and 247 transitions. Second operand 6 states. [2018-01-20 22:07:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:22,493 INFO L93 Difference]: Finished difference Result 405 states and 438 transitions. [2018-01-20 22:07:22,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:07:22,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-01-20 22:07:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:22,494 INFO L225 Difference]: With dead ends: 405 [2018-01-20 22:07:22,494 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:07:22,495 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:07:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:07:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:07:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:07:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:07:22,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2018-01-20 22:07:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:22,496 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:07:22,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:07:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:07:22,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:07:22,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:07:22 BoogieIcfgContainer [2018-01-20 22:07:22,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:07:22,498 INFO L168 Benchmark]: Toolchain (without parser) took 6470.21 ms. Allocated memory was 307.2 MB in the beginning and 571.5 MB in the end (delta: 264.2 MB). Free memory was 265.2 MB in the beginning and 438.5 MB in the end (delta: -173.3 MB). Peak memory consumption was 90.9 MB. Max. memory is 5.3 GB. [2018-01-20 22:07:22,499 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 307.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:07:22,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.12 ms. Allocated memory is still 307.2 MB. Free memory was 264.1 MB in the beginning and 253.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:07:22,500 INFO L168 Benchmark]: Boogie Preprocessor took 40.02 ms. Allocated memory is still 307.2 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:07:22,500 INFO L168 Benchmark]: RCFGBuilder took 511.57 ms. Allocated memory is still 307.2 MB. Free memory was 251.1 MB in the beginning and 214.8 MB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 5.3 GB. [2018-01-20 22:07:22,500 INFO L168 Benchmark]: TraceAbstraction took 5678.72 ms. Allocated memory was 307.2 MB in the beginning and 571.5 MB in the end (delta: 264.2 MB). Free memory was 214.8 MB in the beginning and 438.5 MB in the end (delta: -223.7 MB). Peak memory consumption was 40.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:07:22,502 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.19 ms. Allocated memory is still 307.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.12 ms. Allocated memory is still 307.2 MB. Free memory was 264.1 MB in the beginning and 253.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.02 ms. Allocated memory is still 307.2 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 511.57 ms. Allocated memory is still 307.2 MB. Free memory was 251.1 MB in the beginning and 214.8 MB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5678.72 ms. Allocated memory was 307.2 MB in the beginning and 571.5 MB in the end (delta: 264.2 MB). Free memory was 214.8 MB in the beginning and 438.5 MB in the end (delta: -223.7 MB). Peak memory consumption was 40.6 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: [L587] FCALL struct node_t *list = ((void *)0); VAL [list={98:0}] [L588] int dataNotFinished = 0; VAL [dataNotFinished=0, list={98:0}] [L590] CALL append(&list) VAL [pointerToList={98:0}] [L577] EXPR, FCALL malloc(sizeof *node) VAL [malloc(sizeof *node)={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L577] struct node_t *node = malloc(sizeof *node); VAL [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] FCALL node->next = *pointerToList VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L579] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L579] COND TRUE *pointerToList == ((void *)0) [L580] 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] Data origData = data; VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, origData={91:0}, prevData={0:0}, prevData={0:0}, userInput=-200] [L559] COND FALSE !(__VERIFIER_nondet_int()) [L570] return origData; VAL [\result={91:0}, counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, origData={91:0}, prevData={0:0}, prevData={0:0}, userInput=-200] - StatisticsResult: Ultimate Automizer benchmark data for error location: create_dataErr0EnsuresViolation CFG has 6 procedures, 131 locations, 6 error locations. UNSAFE Result, 1.6s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 671 SDtfs, 91 SDslu, 1054 SDs, 0 SdLazy, 73 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred 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, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 22280 SizeOfPredicates, 2 NumberOfNonLiveVariables, 382 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: 572]: 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, 131 locations, 6 error locations. SAFE Result, 0.4s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 667 SDtfs, 123 SDslu, 494 SDs, 0 SdLazy, 49 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=170occurred 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, 131 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=131occurred 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, 131 locations, 6 error locations. SAFE Result, 0.3s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 685 SDtfs, 123 SDslu, 512 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=176occurred 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: 586]: 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, 131 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, 123 SDslu, 506 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, 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: 576]: 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, 131 locations, 6 error locations. SAFE Result, 2.8s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1003 SDtfs, 281 SDslu, 1965 SDs, 0 SdLazy, 450 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred 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, 78 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 609 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 598 ConstructedInterpolants, 43 QuantifiedInterpolants, 112074 SizeOfPredicates, 4 NumberOfNonLiveVariables, 378 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_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-07-22-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-07-22-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-07-22-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-07-22-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-07-22-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_22-07-22-511.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_22-07-22-511.csv Received shutdown request...