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/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:38:16,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:38:16,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:38:16,177 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:38:16,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:38:16,178 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:38:16,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:38:16,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:38:16,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:38:16,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:38:16,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:38:16,184 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:38:16,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:38:16,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:38:16,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:38:16,188 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:38:16,190 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:38:16,192 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:38:16,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:38:16,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:38:16,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:38:16,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:38:16,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:38:16,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:38:16,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:38:16,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:38:16,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:38:16,200 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:38:16,200 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:38:16,201 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:38:16,201 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:38:16,201 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 18:38:16,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:38:16,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:38:16,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:38:16,213 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:38:16,213 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:38:16,213 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:38:16,213 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:38:16,214 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:38:16,214 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:38:16,214 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:38:16,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:38:16,214 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:38:16,214 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:38:16,214 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:38:16,214 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:38:16,214 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:38:16,215 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:38:16,215 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:38:16,215 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:38:16,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:38:16,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:38:16,215 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:38:16,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:38:16,215 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:38:16,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:38:16,257 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:38:16,261 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:38:16,262 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:38:16,262 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:38:16,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-02-04 18:38:16,386 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:38:16,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:38:16,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:38:16,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:38:16,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:38:16,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:38:16" (1/1) ... [2018-02-04 18:38:16,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16, skipping insertion in model container [2018-02-04 18:38:16,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:38:16" (1/1) ... [2018-02-04 18:38:16,407 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:38:16,435 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:38:16,530 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:38:16,550 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:38:16,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16 WrapperNode [2018-02-04 18:38:16,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:38:16,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:38:16,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:38:16,557 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:38:16,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16" (1/1) ... [2018-02-04 18:38:16,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16" (1/1) ... [2018-02-04 18:38:16,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16" (1/1) ... [2018-02-04 18:38:16,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16" (1/1) ... [2018-02-04 18:38:16,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16" (1/1) ... [2018-02-04 18:38:16,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16" (1/1) ... [2018-02-04 18:38:16,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16" (1/1) ... [2018-02-04 18:38:16,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:38:16,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:38:16,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:38:16,589 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:38:16,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16" (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 18:38:16,643 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:38:16,644 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:38:16,644 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 18:38:16,644 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:38:16,644 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:38:16,644 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:38:16,644 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:38:16,644 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:38:16,645 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:38:16,645 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:38:16,645 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:38:16,645 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:38:16,645 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 18:38:16,645 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:38:16,645 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:38:16,645 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:38:16,948 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:38:16,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:38:16 BoogieIcfgContainer [2018-02-04 18:38:16,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:38:16,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:38:16,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:38:16,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:38:16,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:38:16" (1/3) ... [2018-02-04 18:38:16,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bd9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:38:16, skipping insertion in model container [2018-02-04 18:38:16,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:38:16" (2/3) ... [2018-02-04 18:38:16,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bd9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:38:16, skipping insertion in model container [2018-02-04 18:38:16,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:38:16" (3/3) ... [2018-02-04 18:38:16,953 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-02-04 18:38:16,958 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:38:16,963 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 18:38:16,994 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:38:16,994 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:38:16,994 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:38:16,994 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:38:16,994 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:38:16,995 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:38:16,995 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:38:16,995 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:38:16,995 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:38:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-02-04 18:38:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 18:38:17,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:17,017 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:17,017 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068532, now seen corresponding path program 1 times [2018-02-04 18:38:17,022 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:17,022 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:17,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:17,054 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:17,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:17,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:17,130 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 18:38:17,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:17,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:38:17,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:38:17,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:38:17,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:38:17,142 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-02-04 18:38:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:17,336 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-02-04 18:38:17,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:38:17,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 18:38:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:17,344 INFO L225 Difference]: With dead ends: 110 [2018-02-04 18:38:17,345 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 18:38:17,346 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 18:38:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 18:38:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-02-04 18:38:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 18:38:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-02-04 18:38:17,377 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2018-02-04 18:38:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:17,378 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-02-04 18:38:17,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:38:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-02-04 18:38:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 18:38:17,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:17,378 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:17,378 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068531, now seen corresponding path program 1 times [2018-02-04 18:38:17,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:17,379 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:17,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:17,379 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:17,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:17,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:17,425 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 18:38:17,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:17,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:38:17,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:38:17,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:38:17,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:38:17,427 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 3 states. [2018-02-04 18:38:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:17,519 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-02-04 18:38:17,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:38:17,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 18:38:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:17,522 INFO L225 Difference]: With dead ends: 103 [2018-02-04 18:38:17,522 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 18:38:17,523 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 18:38:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 18:38:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-02-04 18:38:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 18:38:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-02-04 18:38:17,535 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 7 [2018-02-04 18:38:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:17,536 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-02-04 18:38:17,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:38:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-02-04 18:38:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:38:17,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:17,536 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:17,537 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:17,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515713, now seen corresponding path program 1 times [2018-02-04 18:38:17,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:17,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:17,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:17,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:17,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:17,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:17,561 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:17,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:17,562 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:17,562 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:17,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:17,616 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 18:38:17,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:17,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:17,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:38:17,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:17,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:17,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-04 18:38:17,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:17,643 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 18:38:17,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 18:38:17,677 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 18:38:17,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:17,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:38:17,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:38:17,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:38:17,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:38:17,678 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 6 states. [2018-02-04 18:38:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:17,823 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-02-04 18:38:17,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:38:17,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-04 18:38:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:17,824 INFO L225 Difference]: With dead ends: 99 [2018-02-04 18:38:17,824 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 18:38:17,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:38:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 18:38:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-04 18:38:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 18:38:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-02-04 18:38:17,830 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 14 [2018-02-04 18:38:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:17,830 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-02-04 18:38:17,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:38:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-02-04 18:38:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:38:17,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:17,831 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:17,831 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:17,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515714, now seen corresponding path program 1 times [2018-02-04 18:38:17,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:17,831 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:17,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:17,832 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:17,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:17,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:17,849 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:17,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:17,849 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:17,850 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:17,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:17,888 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 18:38:17,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:17,894 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 18:38:17,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:17,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:17,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:38:17,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:17,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:17,931 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 18:38:17,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:17,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:17,938 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 18:38:17,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:17,944 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 18:38:17,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 18:38:17,956 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 18:38:17,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:17,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:38:17,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:38:17,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:38:17,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:38:17,957 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 6 states. [2018-02-04 18:38:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:18,177 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-02-04 18:38:18,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:38:18,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-04 18:38:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:18,178 INFO L225 Difference]: With dead ends: 113 [2018-02-04 18:38:18,178 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 18:38:18,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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 18:38:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 18:38:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2018-02-04 18:38:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 18:38:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-02-04 18:38:18,183 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 14 [2018-02-04 18:38:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:18,183 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-02-04 18:38:18,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:38:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-02-04 18:38:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 18:38:18,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:18,183 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:18,183 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445036, now seen corresponding path program 1 times [2018-02-04 18:38:18,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:18,184 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:18,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:18,184 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:18,185 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:18,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:18,219 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 18:38:18,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:18,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:38:18,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:38:18,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:38:18,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:38:18,220 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 4 states. [2018-02-04 18:38:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:18,270 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-02-04 18:38:18,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:38:18,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 18:38:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:18,271 INFO L225 Difference]: With dead ends: 97 [2018-02-04 18:38:18,271 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 18:38:18,271 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 18:38:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 18:38:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-04 18:38:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 18:38:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-02-04 18:38:18,275 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 15 [2018-02-04 18:38:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:18,275 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-02-04 18:38:18,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:38:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-02-04 18:38:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 18:38:18,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:18,276 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:38:18,276 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445037, now seen corresponding path program 1 times [2018-02-04 18:38:18,276 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:18,276 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:18,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:18,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:18,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:18,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:18,339 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 18:38:18,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:18,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:38:18,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:38:18,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:38:18,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:38:18,340 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 4 states. [2018-02-04 18:38:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:18,418 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-02-04 18:38:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:38:18,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 18:38:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:18,420 INFO L225 Difference]: With dead ends: 93 [2018-02-04 18:38:18,420 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 18:38:18,420 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 18:38:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 18:38:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 18:38:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 18:38:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-02-04 18:38:18,425 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 15 [2018-02-04 18:38:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:18,425 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-02-04 18:38:18,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:38:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-02-04 18:38:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 18:38:18,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:18,426 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] [2018-02-04 18:38:18,426 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash 198602156, now seen corresponding path program 1 times [2018-02-04 18:38:18,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:18,427 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:18,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:18,428 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:18,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:18,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:18,517 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 18:38:18,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:18,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:38:18,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:38:18,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:38:18,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:38:18,518 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 8 states. [2018-02-04 18:38:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:18,697 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-02-04 18:38:18,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:38:18,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 18:38:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:18,698 INFO L225 Difference]: With dead ends: 108 [2018-02-04 18:38:18,698 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 18:38:18,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:38:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 18:38:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2018-02-04 18:38:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 18:38:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-02-04 18:38:18,701 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 20 [2018-02-04 18:38:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:18,701 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-02-04 18:38:18,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:38:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-02-04 18:38:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 18:38:18,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:18,703 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] [2018-02-04 18:38:18,703 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash -524715473, now seen corresponding path program 1 times [2018-02-04 18:38:18,704 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:18,704 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:18,704 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:18,704 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:18,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:18,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:18,762 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 18:38:18,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:18,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:38:18,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:38:18,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:38:18,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:38:18,763 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 7 states. [2018-02-04 18:38:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:18,897 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-02-04 18:38:18,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:38:18,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 18:38:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:18,898 INFO L225 Difference]: With dead ends: 114 [2018-02-04 18:38:18,898 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 18:38:18,898 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 18:38:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 18:38:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2018-02-04 18:38:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 18:38:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-02-04 18:38:18,901 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 32 [2018-02-04 18:38:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:18,901 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-02-04 18:38:18,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:38:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-02-04 18:38:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 18:38:18,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:18,902 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] [2018-02-04 18:38:18,902 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash -524715472, now seen corresponding path program 1 times [2018-02-04 18:38:18,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:18,902 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:18,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:18,902 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:18,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:18,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:19,022 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 18:38:19,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:19,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:38:19,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:38:19,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:38:19,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:38:19,024 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 9 states. [2018-02-04 18:38:19,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:19,243 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-02-04 18:38:19,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 18:38:19,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 18:38:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:19,244 INFO L225 Difference]: With dead ends: 114 [2018-02-04 18:38:19,245 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 18:38:19,245 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 18:38:19,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 18:38:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-02-04 18:38:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 18:38:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-02-04 18:38:19,248 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 32 [2018-02-04 18:38:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:19,249 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-02-04 18:38:19,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:38:19,249 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-02-04 18:38:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 18:38:19,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:19,250 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] [2018-02-04 18:38:19,250 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash -524727421, now seen corresponding path program 1 times [2018-02-04 18:38:19,250 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:19,250 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:19,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,251 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:19,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:19,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:19,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:19,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:38:19,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:38:19,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:38:19,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:38:19,278 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 3 states. [2018-02-04 18:38:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:19,292 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-02-04 18:38:19,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:38:19,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-04 18:38:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:19,300 INFO L225 Difference]: With dead ends: 86 [2018-02-04 18:38:19,300 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 18:38:19,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:38:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 18:38:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 18:38:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 18:38:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-02-04 18:38:19,303 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 32 [2018-02-04 18:38:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:19,303 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-02-04 18:38:19,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:38:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-02-04 18:38:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 18:38:19,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:19,304 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 18:38:19,305 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:19,305 INFO L82 PathProgramCache]: Analyzing trace with hash 947709807, now seen corresponding path program 1 times [2018-02-04 18:38:19,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:19,305 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:19,306 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,306 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:19,306 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:19,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:19,326 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 18:38:19,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:19,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:38:19,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:38:19,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:38:19,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:38:19,327 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 3 states. [2018-02-04 18:38:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:19,333 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-02-04 18:38:19,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:38:19,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-02-04 18:38:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:19,334 INFO L225 Difference]: With dead ends: 83 [2018-02-04 18:38:19,335 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 18:38:19,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:38:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 18:38:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-02-04 18:38:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 18:38:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-02-04 18:38:19,337 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 33 [2018-02-04 18:38:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:19,337 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-02-04 18:38:19,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:38:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-02-04 18:38:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 18:38:19,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:19,338 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 18:38:19,340 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:19,341 INFO L82 PathProgramCache]: Analyzing trace with hash 214855819, now seen corresponding path program 1 times [2018-02-04 18:38:19,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:19,341 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:19,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,342 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:19,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:19,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:19,376 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 18:38:19,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:19,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:38:19,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:38:19,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:38:19,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:38:19,377 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 4 states. [2018-02-04 18:38:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:19,394 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-02-04 18:38:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:38:19,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 18:38:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:19,395 INFO L225 Difference]: With dead ends: 81 [2018-02-04 18:38:19,395 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 18:38:19,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:38:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 18:38:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-02-04 18:38:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 18:38:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-02-04 18:38:19,397 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 35 [2018-02-04 18:38:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:19,397 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-02-04 18:38:19,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:38:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-02-04 18:38:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 18:38:19,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:19,398 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 18:38:19,398 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:19,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322185, now seen corresponding path program 1 times [2018-02-04 18:38:19,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:19,398 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:19,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,399 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:19,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:19,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:19,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 18:38:19,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:19,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:38:19,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:38:19,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:38:19,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:38:19,488 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 8 states. [2018-02-04 18:38:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:19,602 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-02-04 18:38:19,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:38:19,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-04 18:38:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:19,603 INFO L225 Difference]: With dead ends: 79 [2018-02-04 18:38:19,604 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 18:38:19,604 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 18:38:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 18:38:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-04 18:38:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 18:38:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-02-04 18:38:19,606 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 35 [2018-02-04 18:38:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:19,608 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-02-04 18:38:19,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:38:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-02-04 18:38:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 18:38:19,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:19,610 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 18:38:19,610 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:19,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322186, now seen corresponding path program 1 times [2018-02-04 18:38:19,610 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:19,610 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:19,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,611 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:19,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:19,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:19,640 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 18:38:19,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:19,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:38:19,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:38:19,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:38:19,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:38:19,642 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 5 states. [2018-02-04 18:38:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:19,716 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-02-04 18:38:19,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:38:19,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 18:38:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:19,717 INFO L225 Difference]: With dead ends: 78 [2018-02-04 18:38:19,717 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 18:38:19,717 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 18:38:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 18:38:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 18:38:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 18:38:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-04 18:38:19,720 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 35 [2018-02-04 18:38:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:19,720 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-04 18:38:19,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:38:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-04 18:38:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 18:38:19,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:19,721 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] [2018-02-04 18:38:19,721 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash 730389066, now seen corresponding path program 1 times [2018-02-04 18:38:19,721 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:19,722 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:19,722 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,722 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:19,722 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:19,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:19,737 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:19,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:19,737 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:19,738 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:19,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:19,774 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 18:38:19,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:19,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:19,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:38:19,782 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 18:38:19,784 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 18:38:19,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:19,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:19,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:19,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-02-04 18:38:19,839 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 18:38:19,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:19,844 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 18:38:19,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2018-02-04 18:38:19,876 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~item~0.base Int) (append_~plist.offset Int) (|append_#t~ite8.base| Int) (append_~item~0.offset Int) (|append_#t~mem3.base| Int)) (and (<= (select |c_old(#valid)| append_~item~0.base) 0) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) append_~item~0.offset |append_#t~mem3.base|) (+ append_~item~0.offset 4) |append_#t~ite8.base|)))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) append_~plist.offset append_~item~0.base)))))) is different from true [2018-02-04 18:38:19,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:19,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:19,911 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 11 treesize of output 12 [2018-02-04 18:38:19,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:19,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-02-04 18:38:19,928 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 13 treesize of output 16 [2018-02-04 18:38:19,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:19,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 18:38:19,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:19,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:19,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-02-04 18:38:19,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-02-04 18:38:19,974 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 18:38:19,982 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:38:19,992 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:38:20,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:38:20,004 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:55, output treesize:25 [2018-02-04 18:38:20,043 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 21 treesize of output 17 [2018-02-04 18:38:20,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 18:38:20,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:20,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:20,057 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 28 treesize of output 22 [2018-02-04 18:38:20,063 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 18:38:20,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 18:38:20,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:38:20,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:38:20,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:20 [2018-02-04 18:38:20,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:20,119 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 18:38:20,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:20,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:20,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:5 [2018-02-04 18:38:20,127 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 18:38:20,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:20,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 18:38:20,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 18:38:20,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 18:38:20,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=125, Unknown=5, NotChecked=22, Total=182 [2018-02-04 18:38:20,128 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 14 states. [2018-02-04 18:38:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:22,427 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-04 18:38:22,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 18:38:22,427 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-02-04 18:38:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:22,428 INFO L225 Difference]: With dead ends: 93 [2018-02-04 18:38:22,428 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 18:38:22,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=167, Unknown=7, NotChecked=26, Total=240 [2018-02-04 18:38:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 18:38:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-02-04 18:38:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 18:38:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-02-04 18:38:22,431 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 37 [2018-02-04 18:38:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:22,431 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-02-04 18:38:22,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 18:38:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-02-04 18:38:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 18:38:22,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:22,432 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] [2018-02-04 18:38:22,432 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash 730389067, now seen corresponding path program 1 times [2018-02-04 18:38:22,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:22,432 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:22,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:22,433 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:22,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:22,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:38:22,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:22,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:38:22,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:38:22,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:38:22,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:38:22,474 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 4 states. [2018-02-04 18:38:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:22,497 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-02-04 18:38:22,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:38:22,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-02-04 18:38:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:22,498 INFO L225 Difference]: With dead ends: 86 [2018-02-04 18:38:22,498 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 18:38:22,498 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 18:38:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 18:38:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 18:38:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 18:38:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-02-04 18:38:22,500 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 37 [2018-02-04 18:38:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:22,501 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-02-04 18:38:22,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:38:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-02-04 18:38:22,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 18:38:22,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:22,501 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, 1, 1] [2018-02-04 18:38:22,501 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324108, now seen corresponding path program 1 times [2018-02-04 18:38:22,502 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:22,502 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:22,502 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:22,503 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:22,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:22,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:22,518 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:22,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:22,518 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:22,520 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:22,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:22,608 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 18:38:22,612 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 18:38:22,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:22,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:22,620 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 18:38:22,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2018-02-04 18:38:22,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:22,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:22,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 33 [2018-02-04 18:38:22,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:22,689 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 18:38:22,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:32 [2018-02-04 18:38:22,745 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 33 treesize of output 41 [2018-02-04 18:38:22,749 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 34 treesize of output 33 [2018-02-04 18:38:22,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:22,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:22,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:22,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:51 [2018-02-04 18:38:22,917 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 36 treesize of output 34 [2018-02-04 18:38:22,927 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:38:22,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2018-02-04 18:38:22,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:23,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:23,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:23,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:58, output treesize:20 [2018-02-04 18:38:23,128 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 18:38:23,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:38:23,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 18:38:23,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 18:38:23,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 18:38:23,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:38:23,130 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 14 states. [2018-02-04 18:38:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:23,989 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-04 18:38:23,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 18:38:23,990 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-02-04 18:38:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:23,990 INFO L225 Difference]: With dead ends: 90 [2018-02-04 18:38:23,990 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 18:38:23,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-02-04 18:38:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 18:38:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2018-02-04 18:38:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 18:38:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-02-04 18:38:23,993 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 40 [2018-02-04 18:38:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:23,993 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-02-04 18:38:23,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 18:38:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-02-04 18:38:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 18:38:23,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:23,994 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, 1, 1] [2018-02-04 18:38:23,994 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324109, now seen corresponding path program 1 times [2018-02-04 18:38:23,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:23,995 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:23,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:23,995 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:23,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:24,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:24,018 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:38:24,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:38:24,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:38:24,019 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:24,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:38:24,083 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 18:38:24,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 18:38:24,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:24,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:24,136 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 18:38:24,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-02-04 18:38:24,178 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 18:38:24,180 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 18:38:24,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,199 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 18:38:24,201 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 18:38:24,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:24,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:47, output treesize:45 [2018-02-04 18:38:24,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:24,318 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 22 treesize of output 29 [2018-02-04 18:38:24,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:24,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:38:24,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 18:38:24,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:38:24,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:52 [2018-02-04 18:38:24,424 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 39 treesize of output 47 [2018-02-04 18:38:24,427 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 40 treesize of output 39 [2018-02-04 18:38:24,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,471 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 45 treesize of output 51 [2018-02-04 18:38:24,474 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 46 treesize of output 45 [2018-02-04 18:38:24,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,520 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 18:38:24,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:85, output treesize:77 [2018-02-04 18:38:24,572 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 42 treesize of output 40 [2018-02-04 18:38:24,575 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 36 treesize of output 29 [2018-02-04 18:38:24,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,591 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:38:24,592 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 29 treesize of output 23 [2018-02-04 18:38:24,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,608 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:38:24,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-02-04 18:38:24,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,646 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 44 treesize of output 40 [2018-02-04 18:38:24,651 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:38:24,652 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 36 treesize of output 32 [2018-02-04 18:38:24,652 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,669 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 29 treesize of output 18 [2018-02-04 18:38:24,670 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,695 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:38:24,696 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 32 treesize of output 17 [2018-02-04 18:38:24,697 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,704 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:38:24,713 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 18:38:24,713 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:91, output treesize:23 [2018-02-04 18:38:24,737 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 18:38:24,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:38:24,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 18:38:24,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:38:24,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:38:24,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=257, Unknown=1, NotChecked=0, Total=306 [2018-02-04 18:38:24,738 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 18 states. [2018-02-04 18:38:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:25,745 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-04 18:38:25,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:38:25,745 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-02-04 18:38:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:25,746 INFO L225 Difference]: With dead ends: 93 [2018-02-04 18:38:25,746 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 18:38:25,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=872, Unknown=9, NotChecked=0, Total=1122 [2018-02-04 18:38:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 18:38:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-02-04 18:38:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 18:38:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-02-04 18:38:25,748 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 40 [2018-02-04 18:38:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:25,748 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-02-04 18:38:25,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:38:25,748 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-02-04 18:38:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 18:38:25,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:25,749 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 18:38:25,749 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1242227968, now seen corresponding path program 1 times [2018-02-04 18:38:25,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:25,749 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:25,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:25,750 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:25,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:38:25,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:38:25,781 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 18:38:25,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:38:25,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:38:25,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:38:25,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:38:25,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:38:25,782 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 5 states. [2018-02-04 18:38:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:38:25,805 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-02-04 18:38:25,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:38:25,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-04 18:38:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:38:25,806 INFO L225 Difference]: With dead ends: 97 [2018-02-04 18:38:25,806 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 18:38:25,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:38:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 18:38:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-02-04 18:38:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 18:38:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-04 18:38:25,809 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 42 [2018-02-04 18:38:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:38:25,809 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-04 18:38:25,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:38:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-04 18:38:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 18:38:25,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:38:25,810 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, 1, 1] [2018-02-04 18:38:25,810 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 18:38:25,811 INFO L82 PathProgramCache]: Analyzing trace with hash -221032996, now seen corresponding path program 1 times [2018-02-04 18:38:25,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:38:25,812 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:38:25,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:25,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:38:25,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:38:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 18:38:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 18:38:25,860 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 18:38:25,875 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 18:38:25,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:38:25 BoogieIcfgContainer [2018-02-04 18:38:25,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:38:25,892 INFO L168 Benchmark]: Toolchain (without parser) took 9505.07 ms. Allocated memory was 404.8 MB in the beginning and 705.2 MB in the end (delta: 300.4 MB). Free memory was 361.4 MB in the beginning and 540.1 MB in the end (delta: -178.6 MB). Peak memory consumption was 121.8 MB. Max. memory is 5.3 GB. [2018-02-04 18:38:25,893 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:38:25,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.12 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:38:25,893 INFO L168 Benchmark]: Boogie Preprocessor took 31.31 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 MB in the beginning and 349.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:38:25,893 INFO L168 Benchmark]: RCFGBuilder took 360.39 ms. Allocated memory is still 404.8 MB. Free memory was 349.5 MB in the beginning and 319.1 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. [2018-02-04 18:38:25,893 INFO L168 Benchmark]: TraceAbstraction took 8941.91 ms. Allocated memory was 404.8 MB in the beginning and 705.2 MB in the end (delta: 300.4 MB). Free memory was 319.1 MB in the beginning and 540.1 MB in the end (delta: -221.0 MB). Peak memory consumption was 79.4 MB. Max. memory is 5.3 GB. [2018-02-04 18:38:25,895 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 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.12 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.31 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 MB in the beginning and 349.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 360.39 ms. Allocated memory is still 404.8 MB. Free memory was 349.5 MB in the beginning and 319.1 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8941.91 ms. Allocated memory was 404.8 MB in the beginning and 705.2 MB in the end (delta: 300.4 MB). Free memory was 319.1 MB in the beginning and 540.1 MB in the end (delta: -221.0 MB). Peak memory consumption was 79.4 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: 635]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, c=0, list={9:0}] [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={9:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={9:0}] [L627] c++ VAL [\old(c)=0, c=1, plist={9:0}, plist={9:0}] [L628] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={14:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L629] EXPR, FCALL \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={14:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L629] FCALL item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={14:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L630] EXPR, FCALL item->next VAL [\old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [\old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L632] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, \old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, \old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L633] RET, FCALL *plist = item VAL [\old(c)=0, c=1, item={14:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L640] append(&list) VAL [\old(c)=0, c=1, length=0, list={9:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={9:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={9:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={9:0}] [L647] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}] [L647] EXPR, FCALL list->next VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}, next={0:0}] [L648] FCALL free(list) VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}, next={0:0}] [L649] FCALL list = next VAL [\old(c)=0, c=1, length=1, list={9:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, list={9:0}, next={0:0}] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, \result=0, c=1, length=0, list={9:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 43 error locations. UNSAFE Result, 8.9s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1260 SDtfs, 966 SDslu, 2941 SDs, 0 SdLazy, 2369 SolverSat, 128 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 66 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 711 NumberOfCodeBlocks, 711 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 503 ConstructedInterpolants, 57 QuantifiedInterpolants, 138826 SizeOfPredicates, 56 NumberOfNonLiveVariables, 789 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 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_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-38-25-899.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-38-25-899.csv Received shutdown request...