java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:53:37,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:53:37,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:53:37,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:53:37,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:53:37,590 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:53:37,591 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:53:37,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:53:37,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:53:37,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:53:37,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:53:37,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:53:37,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:53:37,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:53:37,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:53:37,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:53:37,600 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:53:37,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:53:37,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:53:37,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:53:37,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:53:37,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:53:37,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:53:37,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:53:37,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:53:37,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:53:37,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:53:37,608 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:53:37,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:53:37,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:53:37,609 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:53:37,609 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:53:37,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:53:37,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:53:37,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:53:37,619 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:53:37,619 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:53:37,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:53:37,619 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:53:37,619 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:53:37,619 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:53:37,619 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:53:37,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:53:37,620 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:53:37,620 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:53:37,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:53:37,620 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:53:37,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:53:37,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:53:37,620 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:53:37,620 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:53:37,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:53:37,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:53:37,621 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:53:37,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:53:37,621 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:53:37,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:53:37,653 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:53:37,655 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:53:37,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:53:37,656 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:53:37,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i [2018-02-04 17:53:37,762 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:53:37,763 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:53:37,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:53:37,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:53:37,767 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:53:37,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:53:37" (1/1) ... [2018-02-04 17:53:37,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7daeeeb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37, skipping insertion in model container [2018-02-04 17:53:37,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:53:37" (1/1) ... [2018-02-04 17:53:37,780 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:53:37,805 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:53:37,886 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:53:37,900 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:53:37,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37 WrapperNode [2018-02-04 17:53:37,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:53:37,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:53:37,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:53:37,906 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:53:37,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37" (1/1) ... [2018-02-04 17:53:37,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37" (1/1) ... [2018-02-04 17:53:37,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37" (1/1) ... [2018-02-04 17:53:37,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37" (1/1) ... [2018-02-04 17:53:37,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37" (1/1) ... [2018-02-04 17:53:37,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37" (1/1) ... [2018-02-04 17:53:37,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37" (1/1) ... [2018-02-04 17:53:37,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:53:37,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:53:37,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:53:37,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:53:37,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:53:37,964 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:53:37,964 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:53:37,964 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 17:53:37,964 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:53:37,964 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 17:53:37,964 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 17:53:37,965 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:53:37,965 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:53:37,965 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:53:37,965 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:53:37,965 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:53:37,965 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:53:37,965 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 17:53:37,965 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:53:37,965 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:53:37,966 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:53:38,229 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:53:38,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:53:38 BoogieIcfgContainer [2018-02-04 17:53:38,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:53:38,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:53:38,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:53:38,233 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:53:38,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:53:37" (1/3) ... [2018-02-04 17:53:38,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d5bc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:53:38, skipping insertion in model container [2018-02-04 17:53:38,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:53:37" (2/3) ... [2018-02-04 17:53:38,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d5bc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:53:38, skipping insertion in model container [2018-02-04 17:53:38,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:53:38" (3/3) ... [2018-02-04 17:53:38,235 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-02-04 17:53:38,239 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:53:38,244 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-02-04 17:53:38,274 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:53:38,274 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:53:38,274 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:53:38,274 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:53:38,275 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:53:38,275 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:53:38,275 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:53:38,275 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:53:38,276 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:53:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2018-02-04 17:53:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 17:53:38,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:38,295 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:38,295 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash -758648706, now seen corresponding path program 1 times [2018-02-04 17:53:38,301 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:38,301 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:38,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:38,343 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:38,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:38,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:38,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:38,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:53:38,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:53:38,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:53:38,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:53:38,442 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2018-02-04 17:53:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:38,569 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 17:53:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:53:38,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 17:53:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:38,624 INFO L225 Difference]: With dead ends: 92 [2018-02-04 17:53:38,624 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 17:53:38,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:53:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 17:53:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-02-04 17:53:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 17:53:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-02-04 17:53:38,659 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 7 [2018-02-04 17:53:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:38,659 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-02-04 17:53:38,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:53:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-02-04 17:53:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 17:53:38,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:38,660 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:38,660 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash -758648705, now seen corresponding path program 1 times [2018-02-04 17:53:38,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:38,661 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:38,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:38,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:38,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:38,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:38,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:38,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:53:38,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:53:38,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:53:38,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:53:38,709 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 3 states. [2018-02-04 17:53:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:38,779 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-02-04 17:53:38,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:53:38,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 17:53:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:38,781 INFO L225 Difference]: With dead ends: 88 [2018-02-04 17:53:38,781 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 17:53:38,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:53:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 17:53:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-02-04 17:53:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 17:53:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-02-04 17:53:38,789 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 7 [2018-02-04 17:53:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:38,789 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-02-04 17:53:38,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:53:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-02-04 17:53:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:53:38,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:38,790 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:38,790 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:38,790 INFO L82 PathProgramCache]: Analyzing trace with hash 689934579, now seen corresponding path program 1 times [2018-02-04 17:53:38,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:38,791 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:38,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:38,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:38,792 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:38,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:38,814 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:38,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:38,815 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:38,815 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:38,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:38,869 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 6 treesize of output 5 [2018-02-04 17:53:38,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:38,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:38,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:53:38,888 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 12 treesize of output 11 [2018-02-04 17:53:38,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:38,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:38,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 17:53:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:38,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:38,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:53:38,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:53:38,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:53:38,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:53:38,909 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 5 states. [2018-02-04 17:53:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:39,018 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-02-04 17:53:39,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:53:39,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 17:53:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:39,019 INFO L225 Difference]: With dead ends: 83 [2018-02-04 17:53:39,019 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 17:53:39,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-02-04 17:53:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 17:53:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 17:53:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 17:53:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-02-04 17:53:39,024 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 13 [2018-02-04 17:53:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:39,025 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-02-04 17:53:39,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:53:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-02-04 17:53:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:53:39,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:39,025 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:39,026 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash 689934580, now seen corresponding path program 1 times [2018-02-04 17:53:39,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:39,026 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:39,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:39,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:39,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:39,045 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:39,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:39,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:39,046 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:39,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:39,080 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 6 treesize of output 5 [2018-02-04 17:53:39,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:39,085 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 6 treesize of output 5 [2018-02-04 17:53:39,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:39,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:39,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:53:39,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:39,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:39,114 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 11 treesize of output 4 [2018-02-04 17:53:39,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:39,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:39,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 17:53:39,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:39,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:39,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 17:53:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:39,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:39,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:53:39,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:53:39,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:53:39,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:53:39,153 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 6 states. [2018-02-04 17:53:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:39,341 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 17:53:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:53:39,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 17:53:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:39,342 INFO L225 Difference]: With dead ends: 92 [2018-02-04 17:53:39,342 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 17:53:39,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:53:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 17:53:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-02-04 17:53:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 17:53:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-02-04 17:53:39,345 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 13 [2018-02-04 17:53:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:39,345 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-02-04 17:53:39,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:53:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-02-04 17:53:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:53:39,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:39,346 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:39,346 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:39,346 INFO L82 PathProgramCache]: Analyzing trace with hash -86864468, now seen corresponding path program 1 times [2018-02-04 17:53:39,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:39,346 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:39,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:39,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:39,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:39,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:39,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:53:39,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:53:39,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:53:39,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:53:39,370 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 4 states. [2018-02-04 17:53:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:39,426 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-02-04 17:53:39,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:53:39,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:53:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:39,427 INFO L225 Difference]: With dead ends: 81 [2018-02-04 17:53:39,427 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 17:53:39,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:53:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 17:53:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 17:53:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 17:53:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 17:53:39,432 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 14 [2018-02-04 17:53:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:39,432 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 17:53:39,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:53:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 17:53:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:53:39,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:39,433 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:39,433 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:39,433 INFO L82 PathProgramCache]: Analyzing trace with hash -86864467, now seen corresponding path program 1 times [2018-02-04 17:53:39,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:39,433 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:39,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,434 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:39,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:39,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:39,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:39,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:53:39,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:53:39,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:53:39,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:53:39,488 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 4 states. [2018-02-04 17:53:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:39,531 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-04 17:53:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:53:39,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:53:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:39,532 INFO L225 Difference]: With dead ends: 77 [2018-02-04 17:53:39,532 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 17:53:39,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:53:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 17:53:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 17:53:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 17:53:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 17:53:39,536 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 14 [2018-02-04 17:53:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:39,536 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 17:53:39,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:53:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 17:53:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:53:39,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:39,537 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:39,537 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1124026018, now seen corresponding path program 1 times [2018-02-04 17:53:39,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:39,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:39,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:39,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:39,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:39,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:39,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:53:39,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:53:39,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:53:39,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:53:39,615 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 8 states. [2018-02-04 17:53:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:39,735 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-02-04 17:53:39,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:53:39,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 17:53:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:39,736 INFO L225 Difference]: With dead ends: 92 [2018-02-04 17:53:39,736 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 17:53:39,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:53:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 17:53:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-02-04 17:53:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 17:53:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-02-04 17:53:39,741 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 19 [2018-02-04 17:53:39,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:39,742 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-02-04 17:53:39,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:53:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-02-04 17:53:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:53:39,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:39,744 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:39,744 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:39,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1338134626, now seen corresponding path program 1 times [2018-02-04 17:53:39,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:39,744 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:39,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:39,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:39,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:39,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:39,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:53:39,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:53:39,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:53:39,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:53:39,800 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 7 states. [2018-02-04 17:53:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:39,956 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-04 17:53:39,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:53:39,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 17:53:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:39,957 INFO L225 Difference]: With dead ends: 93 [2018-02-04 17:53:39,957 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 17:53:39,957 INFO L554 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-02-04 17:53:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 17:53:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-02-04 17:53:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 17:53:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-02-04 17:53:39,959 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 30 [2018-02-04 17:53:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:39,960 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-02-04 17:53:39,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:53:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-02-04 17:53:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:53:39,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:39,960 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:53:39,960 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1338134627, now seen corresponding path program 1 times [2018-02-04 17:53:39,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:39,960 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:39,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,961 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:39,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:39,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:40,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:40,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:53:40,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:53:40,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:53:40,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:53:40,076 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 9 states. [2018-02-04 17:53:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:40,212 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-02-04 17:53:40,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:53:40,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-04 17:53:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:40,213 INFO L225 Difference]: With dead ends: 97 [2018-02-04 17:53:40,213 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 17:53:40,213 INFO L554 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-02-04 17:53:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 17:53:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2018-02-04 17:53:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 17:53:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-02-04 17:53:40,216 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 30 [2018-02-04 17:53:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:40,217 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-02-04 17:53:40,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:53:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-02-04 17:53:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:53:40,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:40,217 INFO L351 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-02-04 17:53:40,217 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash -952870546, now seen corresponding path program 1 times [2018-02-04 17:53:40,217 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:40,218 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:40,218 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:40,218 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:40,218 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:40,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:40,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:40,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:53:40,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:53:40,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:53:40,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:53:40,292 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 5 states. [2018-02-04 17:53:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:40,355 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-02-04 17:53:40,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:53:40,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 17:53:40,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:40,356 INFO L225 Difference]: With dead ends: 84 [2018-02-04 17:53:40,357 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 17:53:40,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:53:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 17:53:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-02-04 17:53:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 17:53:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-02-04 17:53:40,360 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 33 [2018-02-04 17:53:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:40,360 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-02-04 17:53:40,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:53:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-02-04 17:53:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:53:40,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:40,361 INFO L351 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-02-04 17:53:40,362 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:40,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1517792313, now seen corresponding path program 1 times [2018-02-04 17:53:40,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:40,362 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:40,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:40,363 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:40,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:40,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:40,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:40,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:53:40,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:53:40,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:53:40,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:53:40,462 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 8 states. [2018-02-04 17:53:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:40,533 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-02-04 17:53:40,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:53:40,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 17:53:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:40,534 INFO L225 Difference]: With dead ends: 83 [2018-02-04 17:53:40,534 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 17:53:40,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:53:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 17:53:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-02-04 17:53:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 17:53:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-02-04 17:53:40,536 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 33 [2018-02-04 17:53:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:40,537 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-02-04 17:53:40,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:53:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-02-04 17:53:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:53:40,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:40,538 INFO L351 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-02-04 17:53:40,538 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:40,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1517792312, now seen corresponding path program 1 times [2018-02-04 17:53:40,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:40,538 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:40,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:40,539 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:40,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:40,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:40,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:40,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:53:40,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:53:40,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:53:40,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:53:40,587 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 5 states. [2018-02-04 17:53:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:40,640 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-02-04 17:53:40,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:53:40,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 17:53:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:40,641 INFO L225 Difference]: With dead ends: 79 [2018-02-04 17:53:40,641 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 17:53:40,641 INFO L554 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-02-04 17:53:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 17:53:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-04 17:53:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 17:53:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-02-04 17:53:40,644 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 33 [2018-02-04 17:53:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:40,644 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-02-04 17:53:40,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:53:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-02-04 17:53:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 17:53:40,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:40,645 INFO L351 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-02-04 17:53:40,645 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash -881792853, now seen corresponding path program 1 times [2018-02-04 17:53:40,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:40,646 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:40,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:40,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:40,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:40,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:40,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:40,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:53:40,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:53:40,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:53:40,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:53:40,706 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 8 states. [2018-02-04 17:53:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:40,809 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-02-04 17:53:40,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:53:40,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-04 17:53:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:40,810 INFO L225 Difference]: With dead ends: 76 [2018-02-04 17:53:40,810 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 17:53:40,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:53:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 17:53:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 17:53:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 17:53:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-02-04 17:53:40,811 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 35 [2018-02-04 17:53:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:40,812 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-02-04 17:53:40,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:53:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-02-04 17:53:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 17:53:40,812 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:40,812 INFO L351 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-02-04 17:53:40,812 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1690468264, now seen corresponding path program 1 times [2018-02-04 17:53:40,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:40,813 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:40,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:40,813 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:40,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:40,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:40,831 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:40,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:40,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:40,832 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:40,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:40,869 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 6 treesize of output 5 [2018-02-04 17:53:40,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:40,876 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 6 treesize of output 5 [2018-02-04 17:53:40,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:40,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:40,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:53:40,937 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-02-04 17:53:40,939 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-02-04 17:53:40,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:40,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:40,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:40,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:44 [2018-02-04 17:53:40,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:40,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:40,994 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2018-02-04 17:53:40,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 3 [2018-02-04 17:53:41,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:41,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:23 [2018-02-04 17:53:41,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 12 [2018-02-04 17:53:41,038 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:41,038 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 12 treesize of output 8 [2018-02-04 17:53:41,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-02-04 17:53:41,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:41,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 17:53:41,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:53:41,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-02-04 17:53:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:41,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:41,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 17:53:41,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:53:41,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:53:41,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:53:41,104 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 12 states. [2018-02-04 17:53:41,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:41,551 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-02-04 17:53:41,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:53:41,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-04 17:53:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:41,553 INFO L225 Difference]: With dead ends: 112 [2018-02-04 17:53:41,553 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 17:53:41,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:53:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 17:53:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-02-04 17:53:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 17:53:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2018-02-04 17:53:41,556 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 35 [2018-02-04 17:53:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:41,556 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-02-04 17:53:41,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:53:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-02-04 17:53:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 17:53:41,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:41,557 INFO L351 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-02-04 17:53:41,557 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:41,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1690468265, now seen corresponding path program 1 times [2018-02-04 17:53:41,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:41,558 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:41,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:41,559 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:41,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:41,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:41,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:41,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:53:41,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:53:41,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:53:41,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:53:41,591 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 4 states. [2018-02-04 17:53:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:41,613 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-02-04 17:53:41,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:53:41,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 17:53:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:41,615 INFO L225 Difference]: With dead ends: 87 [2018-02-04 17:53:41,615 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 17:53:41,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:53:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 17:53:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-04 17:53:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 17:53:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-02-04 17:53:41,617 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 35 [2018-02-04 17:53:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:41,617 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-02-04 17:53:41,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:53:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-02-04 17:53:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:53:41,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:41,618 INFO L351 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] [2018-02-04 17:53:41,618 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:41,618 INFO L82 PathProgramCache]: Analyzing trace with hash 403683132, now seen corresponding path program 1 times [2018-02-04 17:53:41,619 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:41,619 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:41,619 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:41,619 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:41,619 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:41,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:41,631 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:41,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:41,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:41,632 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:41,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:41,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-02-04 17:53:41,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-02-04 17:53:41,716 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-02-04 17:53:41,718 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-02-04 17:53:41,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:41,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2018-02-04 17:53:41,782 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-02-04 17:53:41,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:41,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-02-04 17:53:41,836 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-02-04 17:53:41,839 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-02-04 17:53:41,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:41,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-02-04 17:53:41,903 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-02-04 17:53:41,906 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:41,907 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 24 treesize of output 20 [2018-02-04 17:53:41,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 10 [2018-02-04 17:53:41,922 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,933 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:41,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-02-04 17:53:41,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:41,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:40, output treesize:5 [2018-02-04 17:53:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:41,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:53:41,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 17:53:41,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:53:41,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:53:41,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:53:41,968 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 13 states. [2018-02-04 17:53:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:42,429 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-02-04 17:53:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:53:42,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-04 17:53:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:42,430 INFO L225 Difference]: With dead ends: 89 [2018-02-04 17:53:42,430 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 17:53:42,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:53:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 17:53:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-02-04 17:53:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 17:53:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-02-04 17:53:42,433 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 38 [2018-02-04 17:53:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:42,433 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-02-04 17:53:42,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:53:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-02-04 17:53:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:53:42,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:42,434 INFO L351 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] [2018-02-04 17:53:42,434 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash 403683133, now seen corresponding path program 1 times [2018-02-04 17:53:42,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:42,435 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:42,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:42,435 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:42,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:42,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:42,451 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:42,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:42,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:42,452 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:42,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:42,574 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-02-04 17:53:42,576 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-02-04 17:53:42,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,588 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-02-04 17:53:42,590 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-02-04 17:53:42,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:42,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:23 [2018-02-04 17:53:42,665 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2018-02-04 17:53:42,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:53:42,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:42,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:31 [2018-02-04 17:53:42,738 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-02-04 17:53:42,742 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-02-04 17:53:42,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,786 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 23 treesize of output 33 [2018-02-04 17:53:42,789 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-02-04 17:53:42,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:42,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:64, output treesize:56 [2018-02-04 17:53:42,863 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-02-04 17:53:42,868 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:42,868 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 24 treesize of output 20 [2018-02-04 17:53:42,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 10 [2018-02-04 17:53:42,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,897 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:42,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-02-04 17:53:42,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,922 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 26 treesize of output 26 [2018-02-04 17:53:42,926 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:42,926 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 22 treesize of output 18 [2018-02-04 17:53:42,927 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,938 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:42,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-02-04 17:53:42,941 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:42,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:42,955 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:70, output treesize:14 [2018-02-04 17:53:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:42,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:53:42,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:53:42,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:53:42,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:53:42,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:53:42,981 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 16 states. [2018-02-04 17:53:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:43,675 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-04 17:53:43,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:53:43,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-02-04 17:53:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:43,676 INFO L225 Difference]: With dead ends: 92 [2018-02-04 17:53:43,676 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 17:53:43,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:53:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 17:53:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-02-04 17:53:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 17:53:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-02-04 17:53:43,679 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 38 [2018-02-04 17:53:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:43,679 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-02-04 17:53:43,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:53:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-02-04 17:53:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 17:53:43,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:43,680 INFO L351 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] [2018-02-04 17:53:43,680 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:43,680 INFO L82 PathProgramCache]: Analyzing trace with hash 467955640, now seen corresponding path program 1 times [2018-02-04 17:53:43,680 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:43,680 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:43,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:43,680 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:43,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:43,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:53:43,691 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:53:43,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:53:43,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:53:43,692 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:53:43,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:53:43,719 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 6 treesize of output 5 [2018-02-04 17:53:43,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:43,724 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 6 treesize of output 5 [2018-02-04 17:53:43,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:43,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:43,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:53:43,742 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-02-04 17:53:43,743 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-02-04 17:53:43,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:43,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:43,765 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-02-04 17:53:43,767 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-02-04 17:53:43,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:43,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:43,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:43,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-02-04 17:53:44,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-02-04 17:53:44,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-02-04 17:53:44,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2018-02-04 17:53:44,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-02-04 17:53:44,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:53:44,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-02-04 17:53:44,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2018-02-04 17:53:44,447 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 17:53:44,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,453 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 20 treesize of output 27 [2018-02-04 17:53:44,454 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,461 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 57 [2018-02-04 17:53:44,493 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 46 treesize of output 36 [2018-02-04 17:53:44,493 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,529 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,549 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2018-02-04 17:53:44,560 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2018-02-04 17:53:44,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 47 [2018-02-04 17:53:44,593 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,607 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-02-04 17:53:44,632 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 13 [2018-02-04 17:53:44,633 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,638 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-02-04 17:53:44,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 53 [2018-02-04 17:53:44,663 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 6 xjuncts. [2018-02-04 17:53:44,685 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,704 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2018-02-04 17:53:44,792 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 17:53:44,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,796 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 20 treesize of output 27 [2018-02-04 17:53:44,796 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,800 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 57 [2018-02-04 17:53:44,822 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:44,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-02-04 17:53:44,826 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-02-04 17:53:44,850 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,860 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,872 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2018-02-04 17:53:44,883 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2018-02-04 17:53:44,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 47 [2018-02-04 17:53:44,895 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,909 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-02-04 17:53:44,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:44,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 53 [2018-02-04 17:53:44,945 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 6 xjuncts. [2018-02-04 17:53:44,963 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:53:44,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-02-04 17:53:44,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:53:44,974 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,979 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:44,992 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:53:45,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 37 dim-0 vars, and 16 xjuncts. [2018-02-04 17:53:45,072 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 11 variables, input treesize:167, output treesize:1046 [2018-02-04 17:53:46,335 WARN L146 SmtUtils]: Spent 1175ms on a formula simplification. DAG size of input: 354 DAG size of output 74 [2018-02-04 17:53:46,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:46,665 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:46,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:46,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:53:46,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 85 [2018-02-04 17:53:46,680 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 101 [2018-02-04 17:53:46,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:53:46,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:46,713 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:46,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-02-04 17:53:46,716 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:46,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 69 treesize of output 74 [2018-02-04 17:53:46,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:46,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:46,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:53:46,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:121, output treesize:70 [2018-02-04 17:53:46,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-02-04 17:53:46,793 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:53:46,793 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 23 treesize of output 13 [2018-02-04 17:53:46,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:46,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-02-04 17:53:46,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:46,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:46,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 17:53:46,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 11 [2018-02-04 17:53:46,811 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:46,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 [2018-02-04 17:53:46,816 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:53:46,818 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:46,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:53:46,822 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:81, output treesize:10 [2018-02-04 17:53:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:53:46,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:53:46,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 17:53:46,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:53:46,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:53:46,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=360, Unknown=8, NotChecked=0, Total=420 [2018-02-04 17:53:46,855 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 21 states. [2018-02-04 17:53:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:53:47,447 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-02-04 17:53:47,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:53:47,448 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-02-04 17:53:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:53:47,448 INFO L225 Difference]: With dead ends: 100 [2018-02-04 17:53:47,448 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 17:53:47,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=72, Invalid=517, Unknown=11, NotChecked=0, Total=600 [2018-02-04 17:53:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 17:53:47,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2018-02-04 17:53:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 17:53:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-02-04 17:53:47,452 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 40 [2018-02-04 17:53:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:53:47,452 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-02-04 17:53:47,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:53:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-02-04 17:53:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 17:53:47,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:53:47,453 INFO L351 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-02-04 17:53:47,453 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 17:53:47,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1267428235, now seen corresponding path program 1 times [2018-02-04 17:53:47,453 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:53:47,453 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:53:47,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:47,454 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:53:47,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:53:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:53:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:53:47,489 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 17:53:47,501 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 17:53:47,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:53:47 BoogieIcfgContainer [2018-02-04 17:53:47,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:53:47,514 INFO L168 Benchmark]: Toolchain (without parser) took 9751.78 ms. Allocated memory was 401.6 MB in the beginning and 755.5 MB in the end (delta: 353.9 MB). Free memory was 358.3 MB in the beginning and 429.5 MB in the end (delta: -71.2 MB). Peak memory consumption was 282.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:53:47,515 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:53:47,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.67 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:53:47,515 INFO L168 Benchmark]: Boogie Preprocessor took 22.70 ms. Allocated memory is still 401.6 MB. Free memory was 347.7 MB in the beginning and 346.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:53:47,516 INFO L168 Benchmark]: RCFGBuilder took 301.57 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 317.3 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:53:47,516 INFO L168 Benchmark]: TraceAbstraction took 9283.29 ms. Allocated memory was 401.6 MB in the beginning and 755.5 MB in the end (delta: 353.9 MB). Free memory was 317.3 MB in the beginning and 429.5 MB in the end (delta: -112.3 MB). Peak memory consumption was 241.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:53:47,517 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.14 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 141.67 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.70 ms. Allocated memory is still 401.6 MB. Free memory was 347.7 MB in the beginning and 346.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 301.57 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 317.3 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9283.29 ms. Allocated memory was 401.6 MB in the beginning and 755.5 MB in the end (delta: 353.9 MB). Free memory was 317.3 MB in the beginning and 429.5 MB in the end (delta: -112.3 MB). Peak memory consumption was 241.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 633]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L635] FCALL struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628] EXPR, FCALL item->next VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L630] EXPR, FCALL malloc(sizeof *item) VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L631] RET, FCALL *plist = item VAL [item={11:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L637] append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}] [L640] EXPR, FCALL list->next VAL [\read(*list)={11:0}, list={10:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={0:0}] [L641] FCALL free(list) VAL [\read(*list)={11:0}, list={10:0}, next={0:0}] [L642] FCALL list = next VAL [list={10:0}, next={0:0}] [L644] FCALL \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; VAL [\result=0, list={10:0}, next={0:0}] [L635] FCALL struct item *list = ((void *)0); VAL [\result=0, list={10:0}, next={0:0}] [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 41 error locations. UNSAFE Result, 9.2s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1006 SDtfs, 954 SDslu, 2716 SDs, 0 SdLazy, 2949 SolverSat, 125 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 79 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 686 NumberOfCodeBlocks, 686 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 449 ConstructedInterpolants, 64 QuantifiedInterpolants, 217715 SizeOfPredicates, 72 NumberOfNonLiveVariables, 882 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 6/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-53-47-521.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-53-47-521.csv Received shutdown request...