java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:12:34,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:12:34,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:12:34,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:12:34,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:12:34,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:12:34,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:12:34,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:12:34,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:12:34,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:12:34,741 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:12:34,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:12:34,741 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:12:34,742 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:12:34,743 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:12:34,746 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:12:34,748 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:12:34,750 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:12:34,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:12:34,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:12:34,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:12:34,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:12:34,755 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:12:34,756 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:12:34,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:12:34,758 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:12:34,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:12:34,758 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:12:34,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:12:34,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:12:34,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:12:34,760 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:12:34,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:12:34,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:12:34,771 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:12:34,771 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:12:34,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:12:34,772 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:12:34,772 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:12:34,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:12:34,773 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:12:34,773 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:12:34,773 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:12:34,773 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:12:34,773 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:12:34,774 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:12:34,774 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:12:34,774 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:12:34,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:12:34,774 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:12:34,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:12:34,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:12:34,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:12:34,775 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:12:34,775 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:12:34,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:12:34,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:12:34,776 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:12:34,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:12:34,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:12:34,777 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:12:34,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:12:34,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:12:34,777 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:12:34,778 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:12:34,778 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:12:34,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:12:34,825 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:12:34,828 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:12:34,829 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:12:34,829 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:12:34,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-01-24 12:12:34,994 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:12:34,998 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:12:34,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:12:34,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:12:35,003 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:12:35,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:12:34" (1/1) ... [2018-01-24 12:12:35,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4430c394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35, skipping insertion in model container [2018-01-24 12:12:35,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:12:34" (1/1) ... [2018-01-24 12:12:35,024 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:12:35,065 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:12:35,183 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:12:35,207 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:12:35,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35 WrapperNode [2018-01-24 12:12:35,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:12:35,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:12:35,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:12:35,215 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:12:35,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35" (1/1) ... [2018-01-24 12:12:35,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35" (1/1) ... [2018-01-24 12:12:35,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35" (1/1) ... [2018-01-24 12:12:35,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35" (1/1) ... [2018-01-24 12:12:35,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35" (1/1) ... [2018-01-24 12:12:35,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35" (1/1) ... [2018-01-24 12:12:35,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35" (1/1) ... [2018-01-24 12:12:35,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:12:35,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:12:35,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:12:35,248 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:12:35,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:12:35,300 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:12:35,301 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:12:35,301 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 12:12:35,301 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:12:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:12:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:12:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:12:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:12:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:12:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:12:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:12:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:12:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 12:12:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:12:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:12:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:12:35,690 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:12:35,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:12:35 BoogieIcfgContainer [2018-01-24 12:12:35,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:12:35,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:12:35,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:12:35,694 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:12:35,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:12:34" (1/3) ... [2018-01-24 12:12:35,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2501e1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:12:35, skipping insertion in model container [2018-01-24 12:12:35,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:12:35" (2/3) ... [2018-01-24 12:12:35,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2501e1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:12:35, skipping insertion in model container [2018-01-24 12:12:35,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:12:35" (3/3) ... [2018-01-24 12:12:35,698 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-01-24 12:12:35,705 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:12:35,712 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-24 12:12:35,752 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:12:35,752 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:12:35,752 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:12:35,752 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:12:35,752 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:12:35,752 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:12:35,752 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:12:35,752 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:12:35,753 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:12:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-01-24 12:12:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 12:12:35,779 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:35,780 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:35,780 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:35,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068532, now seen corresponding path program 1 times [2018-01-24 12:12:35,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:35,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:35,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:35,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:35,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:35,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:35,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:35,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:12:35,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:12:35,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:12:35,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:12:35,944 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-01-24 12:12:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:36,167 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2018-01-24 12:12:36,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:12:36,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 12:12:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:36,178 INFO L225 Difference]: With dead ends: 169 [2018-01-24 12:12:36,179 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 12:12:36,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:12:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 12:12:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-01-24 12:12:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 12:12:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-24 12:12:36,222 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2018-01-24 12:12:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:36,222 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-24 12:12:36,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:12:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-24 12:12:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 12:12:36,223 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:36,223 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:36,223 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068531, now seen corresponding path program 1 times [2018-01-24 12:12:36,224 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:36,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:36,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:36,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:36,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:36,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:36,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:36,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:12:36,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:12:36,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:12:36,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:12:36,294 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 3 states. [2018-01-24 12:12:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:36,475 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-24 12:12:36,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:12:36,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 12:12:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:36,477 INFO L225 Difference]: With dead ends: 104 [2018-01-24 12:12:36,477 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 12:12:36,478 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:12:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 12:12:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-01-24 12:12:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-24 12:12:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-24 12:12:36,489 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 7 [2018-01-24 12:12:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:36,489 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-24 12:12:36,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:12:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-24 12:12:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:12:36,490 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:36,490 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:36,490 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515713, now seen corresponding path program 1 times [2018-01-24 12:12:36,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:36,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:36,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:36,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:36,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:36,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:36,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:36,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:12:36,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:12:36,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:12:36,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:12:36,592 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 5 states. [2018-01-24 12:12:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:36,754 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-01-24 12:12:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:12:36,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:12:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:36,756 INFO L225 Difference]: With dead ends: 104 [2018-01-24 12:12:36,756 INFO L226 Difference]: Without dead ends: 99 [2018-01-24 12:12:36,757 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:12:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-24 12:12:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-01-24 12:12:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 12:12:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-24 12:12:36,766 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 14 [2018-01-24 12:12:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:36,766 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-24 12:12:36,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:12:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-24 12:12:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:12:36,767 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:36,767 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:36,767 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:36,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515714, now seen corresponding path program 1 times [2018-01-24 12:12:36,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:36,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:36,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:36,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:36,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:36,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:36,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:36,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:12:36,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:12:36,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:12:36,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:12:36,898 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-01-24 12:12:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:37,086 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-01-24 12:12:37,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:12:37,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 12:12:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:37,088 INFO L225 Difference]: With dead ends: 95 [2018-01-24 12:12:37,088 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 12:12:37,088 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:12:37,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 12:12:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-24 12:12:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 12:12:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-01-24 12:12:37,094 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 14 [2018-01-24 12:12:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:37,094 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-01-24 12:12:37,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:12:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-01-24 12:12:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:12:37,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:37,094 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:37,095 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445036, now seen corresponding path program 1 times [2018-01-24 12:12:37,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:37,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:37,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:37,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:37,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:37,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:37,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:37,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:12:37,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:12:37,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:12:37,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:12:37,138 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 4 states. [2018-01-24 12:12:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:37,225 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-01-24 12:12:37,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:12:37,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 12:12:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:37,227 INFO L225 Difference]: With dead ends: 86 [2018-01-24 12:12:37,227 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 12:12:37,227 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:12:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 12:12:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-24 12:12:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 12:12:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-01-24 12:12:37,234 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 15 [2018-01-24 12:12:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:37,234 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-01-24 12:12:37,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:12:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-01-24 12:12:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:12:37,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:37,235 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:37,235 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445037, now seen corresponding path program 1 times [2018-01-24 12:12:37,236 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:37,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:37,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:37,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:37,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:37,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:37,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:37,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:12:37,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:12:37,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:12:37,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:12:37,303 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 4 states. [2018-01-24 12:12:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:37,357 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-24 12:12:37,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:12:37,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 12:12:37,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:37,359 INFO L225 Difference]: With dead ends: 82 [2018-01-24 12:12:37,359 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 12:12:37,359 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:12:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 12:12:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-24 12:12:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 12:12:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-24 12:12:37,364 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 15 [2018-01-24 12:12:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:37,364 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-24 12:12:37,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:12:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-24 12:12:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:12:37,365 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:37,365 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] [2018-01-24 12:12:37,365 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:37,365 INFO L82 PathProgramCache]: Analyzing trace with hash 198602156, now seen corresponding path program 1 times [2018-01-24 12:12:37,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:37,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:37,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:37,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:37,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:37,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:37,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:37,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:12:37,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:12:37,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:12:37,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:12:37,504 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 8 states. [2018-01-24 12:12:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:37,708 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-01-24 12:12:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:12:37,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 12:12:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:37,710 INFO L225 Difference]: With dead ends: 163 [2018-01-24 12:12:37,710 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 12:12:37,711 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:12:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 12:12:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-01-24 12:12:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:12:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 12:12:37,718 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 20 [2018-01-24 12:12:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:37,719 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 12:12:37,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:12:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 12:12:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:12:37,721 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:37,722 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-24 12:12:37,722 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:37,722 INFO L82 PathProgramCache]: Analyzing trace with hash -524715473, now seen corresponding path program 1 times [2018-01-24 12:12:37,722 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:37,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:37,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:37,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:37,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:37,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:37,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:37,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:12:37,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:12:37,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:12:37,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:12:37,799 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 7 states. [2018-01-24 12:12:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:37,979 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-01-24 12:12:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:12:37,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-24 12:12:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:37,981 INFO L225 Difference]: With dead ends: 109 [2018-01-24 12:12:37,981 INFO L226 Difference]: Without dead ends: 108 [2018-01-24 12:12:37,981 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:12:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-24 12:12:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-01-24 12:12:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 12:12:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-01-24 12:12:37,988 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 32 [2018-01-24 12:12:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:37,988 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-01-24 12:12:37,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:12:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-01-24 12:12:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:12:37,989 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:37,989 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:37,989 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash -524715472, now seen corresponding path program 1 times [2018-01-24 12:12:37,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:37,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:37,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:37,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:37,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:38,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:38,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:38,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:12:38,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:12:38,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:12:38,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:12:38,164 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 9 states. [2018-01-24 12:12:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:38,381 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-24 12:12:38,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:12:38,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 12:12:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:38,423 INFO L225 Difference]: With dead ends: 106 [2018-01-24 12:12:38,424 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 12:12:38,424 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:12:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 12:12:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2018-01-24 12:12:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:12:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 12:12:38,430 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 32 [2018-01-24 12:12:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:38,431 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 12:12:38,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:12:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 12:12:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:12:38,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:38,432 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-24 12:12:38,432 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash -524727421, now seen corresponding path program 1 times [2018-01-24 12:12:38,433 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:38,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:38,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:38,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:38,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:38,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:38,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:38,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:12:38,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:12:38,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:12:38,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:12:38,474 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 3 states. [2018-01-24 12:12:38,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:38,488 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-01-24 12:12:38,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:12:38,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-24 12:12:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:38,489 INFO L225 Difference]: With dead ends: 117 [2018-01-24 12:12:38,489 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 12:12:38,490 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:12:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 12:12:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-24 12:12:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 12:12:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-24 12:12:38,494 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 32 [2018-01-24 12:12:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:38,495 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-24 12:12:38,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:12:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-24 12:12:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:12:38,496 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:38,496 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] [2018-01-24 12:12:38,496 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:38,497 INFO L82 PathProgramCache]: Analyzing trace with hash 947709807, now seen corresponding path program 1 times [2018-01-24 12:12:38,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:38,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:38,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:38,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:38,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:38,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:38,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:38,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:12:38,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:12:38,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:12:38,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:12:38,542 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 3 states. [2018-01-24 12:12:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:38,588 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-01-24 12:12:38,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:12:38,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-24 12:12:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:38,589 INFO L225 Difference]: With dead ends: 99 [2018-01-24 12:12:38,589 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 12:12:38,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:12:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 12:12:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-01-24 12:12:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 12:12:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-24 12:12:38,593 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 33 [2018-01-24 12:12:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:38,594 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-24 12:12:38,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:12:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-24 12:12:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 12:12:38,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:38,595 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] [2018-01-24 12:12:38,596 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash 214855819, now seen corresponding path program 1 times [2018-01-24 12:12:38,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:38,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:38,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:38,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:38,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:38,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:38,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:38,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:12:38,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:12:38,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:12:38,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:12:38,662 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 4 states. [2018-01-24 12:12:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:38,718 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-01-24 12:12:38,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:12:38,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-24 12:12:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:38,719 INFO L225 Difference]: With dead ends: 84 [2018-01-24 12:12:38,719 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 12:12:38,720 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-24 12:12:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 12:12:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-01-24 12:12:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 12:12:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-24 12:12:38,723 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 35 [2018-01-24 12:12:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:38,723 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-24 12:12:38,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:12:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-24 12:12:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 12:12:38,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:38,724 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] [2018-01-24 12:12:38,725 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:38,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322185, now seen corresponding path program 1 times [2018-01-24 12:12:38,725 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:38,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:38,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:38,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:38,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:38,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:38,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:38,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:12:38,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:12:38,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:12:38,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:12:38,911 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 8 states. [2018-01-24 12:12:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:39,095 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-24 12:12:39,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:12:39,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-24 12:12:39,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:39,096 INFO L225 Difference]: With dead ends: 76 [2018-01-24 12:12:39,097 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 12:12:39,097 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:12:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 12:12:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-24 12:12:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 12:12:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-01-24 12:12:39,100 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 35 [2018-01-24 12:12:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:39,101 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-01-24 12:12:39,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:12:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-01-24 12:12:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 12:12:39,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:39,102 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] [2018-01-24 12:12:39,102 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322186, now seen corresponding path program 1 times [2018-01-24 12:12:39,102 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:39,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:39,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:39,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:39,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:39,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:39,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:39,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:12:39,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:12:39,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:12:39,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:12:39,182 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2018-01-24 12:12:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:39,275 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-01-24 12:12:39,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:12:39,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-24 12:12:39,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:39,276 INFO L225 Difference]: With dead ends: 75 [2018-01-24 12:12:39,276 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 12:12:39,276 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:12:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 12:12:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 12:12:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 12:12:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-01-24 12:12:39,281 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 35 [2018-01-24 12:12:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:39,281 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-01-24 12:12:39,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:12:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-01-24 12:12:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:12:39,282 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:39,283 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] [2018-01-24 12:12:39,283 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:39,283 INFO L82 PathProgramCache]: Analyzing trace with hash 730389066, now seen corresponding path program 1 times [2018-01-24 12:12:39,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:39,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:39,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:39,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:39,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:39,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:39,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:39,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:12:39,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:12:39,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:12:39,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:12:39,512 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 10 states. [2018-01-24 12:12:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:39,756 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-01-24 12:12:39,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:12:39,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-24 12:12:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:39,757 INFO L225 Difference]: With dead ends: 74 [2018-01-24 12:12:39,757 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 12:12:39,757 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:12:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 12:12:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 12:12:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 12:12:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-01-24 12:12:39,762 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 37 [2018-01-24 12:12:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:39,762 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-01-24 12:12:39,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:12:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-01-24 12:12:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 12:12:39,763 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:39,763 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:39,763 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324108, now seen corresponding path program 1 times [2018-01-24 12:12:39,764 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:39,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:39,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:39,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:39,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:39,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:40,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:40,020 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:12:40,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:40,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:40,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:12:40,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:12:40,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:40,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:40,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:40,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 12:12:40,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-24 12:12:40,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:40,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:40,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-24 12:12:40,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-24 12:12:40,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 12:12:40,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:40,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:40,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:12:40,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-24 12:12:40,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-24 12:12:40,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 12:12:40,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:40,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:40,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:12:40,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-01-24 12:12:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:40,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:12:40,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2018-01-24 12:12:40,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:12:40,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:12:40,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:12:40,565 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 20 states. [2018-01-24 12:12:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:41,408 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-01-24 12:12:41,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:12:41,409 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-01-24 12:12:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:41,409 INFO L225 Difference]: With dead ends: 82 [2018-01-24 12:12:41,409 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 12:12:41,410 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-01-24 12:12:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 12:12:41,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-01-24 12:12:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 12:12:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-01-24 12:12:41,416 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 40 [2018-01-24 12:12:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:41,417 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-01-24 12:12:41,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:12:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-01-24 12:12:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 12:12:41,418 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:41,418 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:41,418 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:41,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324109, now seen corresponding path program 1 times [2018-01-24 12:12:41,418 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:41,418 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:41,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:41,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:41,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:41,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:41,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:12:41,717 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:12:41,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:41,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:12:41,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:12:41,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:12:41,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:41,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:41,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:12:41,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:12:41,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:41,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:41,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:41,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-01-24 12:12:42,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:42,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:12:42,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 12:12:42,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:12:42,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-01-24 12:12:42,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-01-24 12:12:42,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-01-24 12:12:42,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-01-24 12:12:42,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-24 12:12:42,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:12:42,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-01-24 12:12:42,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-01-24 12:12:42,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-01-24 12:12:42,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-01-24 12:12:42,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-01-24 12:12:42,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:12:42,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:12:42,346 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-01-24 12:12:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:42,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:12:42,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-01-24 12:12:42,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 12:12:42,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 12:12:42,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=574, Unknown=1, NotChecked=0, Total=650 [2018-01-24 12:12:42,397 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 26 states. [2018-01-24 12:12:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:43,587 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-01-24 12:12:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:12:43,587 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2018-01-24 12:12:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:43,588 INFO L225 Difference]: With dead ends: 84 [2018-01-24 12:12:43,588 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 12:12:43,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=295, Invalid=1342, Unknown=3, NotChecked=0, Total=1640 [2018-01-24 12:12:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 12:12:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2018-01-24 12:12:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 12:12:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-01-24 12:12:43,594 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 40 [2018-01-24 12:12:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:43,595 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-01-24 12:12:43,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 12:12:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-01-24 12:12:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:12:43,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:43,596 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] [2018-01-24 12:12:43,596 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1242227968, now seen corresponding path program 1 times [2018-01-24 12:12:43,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:43,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:43,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:43,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:43,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:12:43,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:12:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:12:43,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:12:43,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:12:43,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:12:43,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:12:43,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:12:43,672 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2018-01-24 12:12:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:12:43,695 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-01-24 12:12:43,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:12:43,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-24 12:12:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:12:43,696 INFO L225 Difference]: With dead ends: 116 [2018-01-24 12:12:43,696 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:12:43,696 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 12:12:43,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:12:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-01-24 12:12:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 12:12:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-24 12:12:43,701 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 42 [2018-01-24 12:12:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:12:43,702 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-24 12:12:43,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:12:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-24 12:12:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:12:43,702 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:12:43,703 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:12:43,703 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 12:12:43,703 INFO L82 PathProgramCache]: Analyzing trace with hash -221032996, now seen corresponding path program 1 times [2018-01-24 12:12:43,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:12:43,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:12:43,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:43,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:12:43,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:12:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 12:12:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 12:12:43,767 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 12:12:43,793 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 12:12:43,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:12:43 BoogieIcfgContainer [2018-01-24 12:12:43,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:12:43,816 INFO L168 Benchmark]: Toolchain (without parser) took 8822.29 ms. Allocated memory was 304.1 MB in the beginning and 577.8 MB in the end (delta: 273.7 MB). Free memory was 264.1 MB in the beginning and 499.0 MB in the end (delta: -234.9 MB). Peak memory consumption was 38.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:12:43,817 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:12:43,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.94 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 252.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:12:43,818 INFO L168 Benchmark]: Boogie Preprocessor took 33.04 ms. Allocated memory is still 304.1 MB. Free memory was 252.2 MB in the beginning and 251.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 12:12:43,818 INFO L168 Benchmark]: RCFGBuilder took 442.38 ms. Allocated memory is still 304.1 MB. Free memory was 251.2 MB in the beginning and 223.3 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:12:43,818 INFO L168 Benchmark]: TraceAbstraction took 8124.26 ms. Allocated memory was 304.1 MB in the beginning and 577.8 MB in the end (delta: 273.7 MB). Free memory was 222.3 MB in the beginning and 499.0 MB in the end (delta: -276.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:12:43,820 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.12 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.94 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 252.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.04 ms. Allocated memory is still 304.1 MB. Free memory was 252.2 MB in the beginning and 251.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 442.38 ms. Allocated memory is still 304.1 MB. Free memory was 251.2 MB in the beginning and 223.3 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8124.26 ms. Allocated memory was 304.1 MB in the beginning and 577.8 MB in the end (delta: 273.7 MB). Free memory was 222.3 MB in the beginning and 499.0 MB in the end (delta: -276.8 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, c=0, list={9:0}] [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={9:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={9:0}] [L627] c++ VAL [\old(c)=0, c=1, plist={9:0}, plist={9:0}] [L628] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L629] EXPR, FCALL \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L629] FCALL item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630] EXPR, FCALL item->next VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L632] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={12:0}, plist={9:0}, plist={9:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={12:0}, \old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={12:0}, plist={9:0}, plist={9:0}] [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={12:0}, \old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={12:0}, plist={9:0}, plist={9:0}] [L633] RET, FCALL *plist = item VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={12:0}, plist={9:0}, plist={9:0}] [L640] append(&list) VAL [\old(c)=0, c=1, length=0, list={9:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={9:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={9:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={9:0}] [L647] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={9:0}] [L647] EXPR, FCALL list->next VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={9:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={9:0}, next={0:0}] [L648] FCALL free(list) VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={9:0}, next={0:0}] [L649] FCALL list = next VAL [\old(c)=0, c=1, length=1, list={9:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, list={9:0}, next={0:0}] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, \result=0, c=1, length=0, list={9:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 43 error locations. UNSAFE Result, 8.0s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1145 SDtfs, 1015 SDslu, 2911 SDs, 0 SdLazy, 2349 SolverSat, 166 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 78 SyntacticMatches, 10 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred 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: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 64 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 545 ConstructedInterpolants, 11 QuantifiedInterpolants, 128096 SizeOfPredicates, 35 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 12/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-12-43-828.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-12-43-828.csv Received shutdown request...