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_Camel.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 13:21:16,476 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:21:16,477 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:21:16,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:21:16,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:21:16,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:21:16,490 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:21:16,491 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:21:16,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:21:16,493 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:21:16,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:21:16,494 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:21:16,494 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:21:16,495 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:21:16,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:21:16,498 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:21:16,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:21:16,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:21:16,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:21:16,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:21:16,504 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:21:16,505 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:21:16,505 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:21:16,506 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:21:16,506 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:21:16,507 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:21:16,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:21:16,508 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:21:16,508 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:21:16,508 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:21:16,509 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:21:16,509 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:21:16,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:21:16,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:21:16,519 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:21:16,519 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:21:16,520 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:21:16,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:21:16,520 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:21:16,520 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:21:16,520 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:21:16,520 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:21:16,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:21:16,521 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:21:16,521 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:21:16,521 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:21:16,521 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:21:16,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:21:16,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:21:16,521 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:21:16,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:21:16,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:21:16,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:21:16,522 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:21:16,522 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:21:16,522 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:21:16,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:21:16,555 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:21:16,557 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:21:16,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:21:16,559 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:21:16,560 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 13:21:16,691 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:21:16,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:21:16,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:21:16,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:21:16,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:21:16,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:21:16" (1/1) ... [2018-02-04 13:21:16,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e66bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:16, skipping insertion in model container [2018-02-04 13:21:16,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:21:16" (1/1) ... [2018-02-04 13:21:16,717 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:21:16,745 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:21:16,829 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:21:16,841 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:21:16,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:16 WrapperNode [2018-02-04 13:21:16,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:21:16,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:21:16,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:21:16,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:21:16,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:16" (1/1) ... [2018-02-04 13:21:16,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:16" (1/1) ... [2018-02-04 13:21:16,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:16" (1/1) ... [2018-02-04 13:21:16,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:16" (1/1) ... [2018-02-04 13:21:16,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:16" (1/1) ... [2018-02-04 13:21:16,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:16" (1/1) ... [2018-02-04 13:21:16,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:16" (1/1) ... [2018-02-04 13:21:16,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:21:16,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:21:16,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:21:16,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:21:16,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21: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 13:21:16,910 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:21:16,911 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:21:16,911 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 13:21:16,911 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:21:16,911 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:21:16,911 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:21:16,911 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:21:16,911 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:21:16,911 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:21:16,911 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:21:16,911 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:21:16,911 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:21:16,911 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 13:21:16,912 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:21:16,912 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:21:16,912 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:21:17,216 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:21:17,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:21:17 BoogieIcfgContainer [2018-02-04 13:21:17,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:21:17,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:21:17,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:21:17,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:21:17,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:21:16" (1/3) ... [2018-02-04 13:21:17,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae80d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:21:17, skipping insertion in model container [2018-02-04 13:21:17,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:16" (2/3) ... [2018-02-04 13:21:17,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae80d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:21:17, skipping insertion in model container [2018-02-04 13:21:17,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:21:17" (3/3) ... [2018-02-04 13:21:17,223 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-02-04 13:21:17,231 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:21:17,237 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 13:21:17,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:21:17,268 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:21:17,269 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:21:17,269 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:21:17,269 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:21:17,269 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:21:17,269 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:21:17,269 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:21:17,270 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:21:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-02-04 13:21:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 13:21:17,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:17,291 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:17,291 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 13:21:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068532, now seen corresponding path program 1 times [2018-02-04 13:21:17,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:17,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:17,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:17,331 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:17,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:17,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:17,419 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 13:21:17,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:17,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:21:17,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:21:17,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:21:17,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:21:17,432 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-02-04 13:21:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:17,596 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-02-04 13:21:17,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:21:17,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 13:21:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:17,608 INFO L225 Difference]: With dead ends: 110 [2018-02-04 13:21:17,608 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 13:21:17,609 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 13:21:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 13:21:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-02-04 13:21:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 13:21:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-02-04 13:21:17,642 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2018-02-04 13:21:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:17,643 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-02-04 13:21:17,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:21:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-02-04 13:21:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 13:21:17,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:17,643 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:17,643 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 13:21:17,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068531, now seen corresponding path program 1 times [2018-02-04 13:21:17,644 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:17,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:17,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:17,645 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:17,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:17,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:17,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:17,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:21:17,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:21:17,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:21:17,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:21:17,699 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 3 states. [2018-02-04 13:21:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:17,757 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-02-04 13:21:17,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:21:17,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 13:21:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:17,759 INFO L225 Difference]: With dead ends: 103 [2018-02-04 13:21:17,759 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 13:21:17,760 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 13:21:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 13:21:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-02-04 13:21:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 13:21:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-02-04 13:21:17,767 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 7 [2018-02-04 13:21:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:17,767 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-02-04 13:21:17,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:21:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-02-04 13:21:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:21:17,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:17,768 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:17,768 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 13:21:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515713, now seen corresponding path program 1 times [2018-02-04 13:21:17,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:17,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:17,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:17,769 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:17,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:17,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:17,838 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 13:21:17,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:17,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:21:17,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:21:17,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:21:17,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:21:17,839 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 5 states. [2018-02-04 13:21:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:17,960 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-02-04 13:21:17,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:21:17,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 13:21:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:17,963 INFO L225 Difference]: With dead ends: 99 [2018-02-04 13:21:17,963 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 13:21:17,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:21:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 13:21:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-04 13:21:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 13:21:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-02-04 13:21:17,967 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 14 [2018-02-04 13:21:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:17,968 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-02-04 13:21:17,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:21:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-02-04 13:21:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:21:17,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:17,968 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:17,968 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 13:21:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515714, now seen corresponding path program 1 times [2018-02-04 13:21:17,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:17,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:17,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:17,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:17,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:17,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:18,067 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 13:21:18,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:18,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:21:18,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:21:18,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:21:18,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:21:18,068 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-02-04 13:21:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:18,271 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-04 13:21:18,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:21:18,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 13:21:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:18,272 INFO L225 Difference]: With dead ends: 125 [2018-02-04 13:21:18,272 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 13:21:18,273 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:21:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 13:21:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2018-02-04 13:21:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 13:21:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-02-04 13:21:18,278 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 14 [2018-02-04 13:21:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:18,278 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-02-04 13:21:18,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:21:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-02-04 13:21:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 13:21:18,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:18,279 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:18,279 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 13:21:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445036, now seen corresponding path program 1 times [2018-02-04 13:21:18,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:18,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:18,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:18,280 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:18,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:18,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:18,311 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 13:21:18,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:18,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:21:18,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:21:18,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:21:18,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:21:18,312 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 4 states. [2018-02-04 13:21:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:18,367 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-02-04 13:21:18,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:21:18,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 13:21:18,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:18,367 INFO L225 Difference]: With dead ends: 111 [2018-02-04 13:21:18,368 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 13:21:18,368 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 13:21:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 13:21:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-04 13:21:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 13:21:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-02-04 13:21:18,373 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2018-02-04 13:21:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:18,373 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-02-04 13:21:18,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:21:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-02-04 13:21:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 13:21:18,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:18,374 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:18,374 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 13:21:18,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445037, now seen corresponding path program 1 times [2018-02-04 13:21:18,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:18,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:18,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:18,375 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:18,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:18,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:18,412 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 13:21:18,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:18,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:21:18,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:21:18,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:21:18,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:21:18,413 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 4 states. [2018-02-04 13:21:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:18,472 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-02-04 13:21:18,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:21:18,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 13:21:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:18,473 INFO L225 Difference]: With dead ends: 107 [2018-02-04 13:21:18,473 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 13:21:18,473 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 13:21:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 13:21:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-04 13:21:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 13:21:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2018-02-04 13:21:18,484 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 15 [2018-02-04 13:21:18,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:18,484 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2018-02-04 13:21:18,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:21:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2018-02-04 13:21:18,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 13:21:18,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:18,485 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 13:21:18,485 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 13:21:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash 198602156, now seen corresponding path program 1 times [2018-02-04 13:21:18,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:18,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:18,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:18,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:18,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:18,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:18,573 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 13:21:18,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:18,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:21:18,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:21:18,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:21:18,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:21:18,574 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 8 states. [2018-02-04 13:21:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:18,761 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-02-04 13:21:18,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:21:18,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 13:21:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:18,762 INFO L225 Difference]: With dead ends: 104 [2018-02-04 13:21:18,762 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 13:21:18,762 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 13:21:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 13:21:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-02-04 13:21:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 13:21:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-02-04 13:21:18,765 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 20 [2018-02-04 13:21:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:18,765 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-02-04 13:21:18,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:21:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-02-04 13:21:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:21:18,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:18,766 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] [2018-02-04 13:21:18,766 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 13:21:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1229999684, now seen corresponding path program 1 times [2018-02-04 13:21:18,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:18,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:18,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:18,767 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:18,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:18,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:18,861 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 13:21:18,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:18,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:21:18,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:21:18,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:21:18,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:21:18,862 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 6 states. [2018-02-04 13:21:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:18,944 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-04 13:21:18,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:21:18,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 13:21:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:18,945 INFO L225 Difference]: With dead ends: 120 [2018-02-04 13:21:18,945 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 13:21:18,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:21:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 13:21:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2018-02-04 13:21:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 13:21:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-02-04 13:21:18,950 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 31 [2018-02-04 13:21:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:18,950 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-02-04 13:21:18,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:21:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-02-04 13:21:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:21:18,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:18,951 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 13:21:18,951 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 13:21:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash -524715473, now seen corresponding path program 1 times [2018-02-04 13:21:18,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:18,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:18,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:18,952 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:18,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:18,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:19,004 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 13:21:19,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:19,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:21:19,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:21:19,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:21:19,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:21:19,005 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 7 states. [2018-02-04 13:21:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:19,101 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-04 13:21:19,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:21:19,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 13:21:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:19,102 INFO L225 Difference]: With dead ends: 130 [2018-02-04 13:21:19,102 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 13:21:19,102 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 13:21:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 13:21:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2018-02-04 13:21:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 13:21:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-02-04 13:21:19,105 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 32 [2018-02-04 13:21:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:19,105 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-02-04 13:21:19,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:21:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-02-04 13:21:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:21:19,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:19,106 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 13:21:19,106 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 13:21:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash -524715472, now seen corresponding path program 1 times [2018-02-04 13:21:19,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:19,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:19,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:19,108 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:19,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:19,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:19,221 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 13:21:19,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:19,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:21:19,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:21:19,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:21:19,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:21:19,223 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 9 states. [2018-02-04 13:21:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:19,407 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-04 13:21:19,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:21:19,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 13:21:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:19,408 INFO L225 Difference]: With dead ends: 127 [2018-02-04 13:21:19,409 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 13:21:19,409 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 13:21:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 13:21:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2018-02-04 13:21:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 13:21:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-02-04 13:21:19,411 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 32 [2018-02-04 13:21:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:19,411 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-02-04 13:21:19,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:21:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-02-04 13:21:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:21:19,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:19,412 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 13:21:19,412 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 13:21:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -524727421, now seen corresponding path program 1 times [2018-02-04 13:21:19,412 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:19,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:19,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:19,413 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:19,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:19,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:19,439 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 13:21:19,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:19,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:21:19,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:21:19,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:21:19,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:21:19,440 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 3 states. [2018-02-04 13:21:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:19,451 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-02-04 13:21:19,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:21:19,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-04 13:21:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:19,455 INFO L225 Difference]: With dead ends: 96 [2018-02-04 13:21:19,456 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 13:21:19,456 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 13:21:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 13:21:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-04 13:21:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 13:21:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-02-04 13:21:19,458 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 32 [2018-02-04 13:21:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:19,459 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-02-04 13:21:19,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:21:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-02-04 13:21:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 13:21:19,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:19,460 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 13:21:19,460 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 13:21:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash 947709807, now seen corresponding path program 1 times [2018-02-04 13:21:19,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:19,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:19,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:19,461 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:19,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:19,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:19,482 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 13:21:19,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:19,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:21:19,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:21:19,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:21:19,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:21:19,483 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 3 states. [2018-02-04 13:21:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:19,492 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-02-04 13:21:19,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:21:19,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-02-04 13:21:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:19,493 INFO L225 Difference]: With dead ends: 96 [2018-02-04 13:21:19,493 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 13:21:19,493 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 13:21:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 13:21:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-04 13:21:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 13:21:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-02-04 13:21:19,495 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 33 [2018-02-04 13:21:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:19,496 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-02-04 13:21:19,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:21:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-02-04 13:21:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:21:19,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:19,496 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:19,497 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 13:21:19,497 INFO L82 PathProgramCache]: Analyzing trace with hash -302598238, now seen corresponding path program 1 times [2018-02-04 13:21:19,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:19,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:19,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:19,498 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:19,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:19,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:19,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:19,610 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:21:19,616 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:19,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:19,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:19,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:19,766 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 13:21:19,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:19,776 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 12 treesize of output 15 [2018-02-04 13:21:19,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:19,782 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 13:21:19,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 13:21:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:19,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:19,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-02-04 13:21:19,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:21:19,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:21:19,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:21:19,853 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 14 states. [2018-02-04 13:21:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:20,043 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 13:21:20,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:21:20,044 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-04 13:21:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:20,044 INFO L225 Difference]: With dead ends: 91 [2018-02-04 13:21:20,044 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 13:21:20,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:21:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 13:21:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-02-04 13:21:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 13:21:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-02-04 13:21:20,047 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 34 [2018-02-04 13:21:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:20,047 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-02-04 13:21:20,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:21:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-02-04 13:21:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:21:20,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:20,048 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 13:21:20,048 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 13:21:20,048 INFO L82 PathProgramCache]: Analyzing trace with hash 214855819, now seen corresponding path program 1 times [2018-02-04 13:21:20,048 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:20,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:20,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:20,049 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:20,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:20,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:20,108 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 13:21:20,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:20,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:21:20,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:21:20,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:21:20,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:21:20,109 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 4 states. [2018-02-04 13:21:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:20,127 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-02-04 13:21:20,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:21:20,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 13:21:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:20,128 INFO L225 Difference]: With dead ends: 84 [2018-02-04 13:21:20,128 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 13:21:20,129 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 13:21:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 13:21:20,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-04 13:21:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 13:21:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-02-04 13:21:20,136 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 35 [2018-02-04 13:21:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:20,136 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-02-04 13:21:20,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:21:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-02-04 13:21:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:21:20,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:20,137 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 13:21:20,138 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 13:21:20,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322185, now seen corresponding path program 1 times [2018-02-04 13:21:20,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:20,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:20,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:20,140 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:20,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:20,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:20,208 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 13:21:20,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:20,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:21:20,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:21:20,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:21:20,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:21:20,210 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 8 states. [2018-02-04 13:21:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:20,327 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-02-04 13:21:20,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:21:20,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-04 13:21:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:20,328 INFO L225 Difference]: With dead ends: 82 [2018-02-04 13:21:20,328 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 13:21:20,329 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 13:21:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 13:21:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 13:21:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 13:21:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-02-04 13:21:20,331 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 35 [2018-02-04 13:21:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:20,331 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-02-04 13:21:20,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:21:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-02-04 13:21:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:21:20,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:20,332 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 13:21:20,332 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 13:21:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322186, now seen corresponding path program 1 times [2018-02-04 13:21:20,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:20,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:20,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:20,333 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:20,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:20,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:20,363 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 13:21:20,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:20,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:21:20,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:21:20,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:21:20,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:21:20,365 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 5 states. [2018-02-04 13:21:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:20,430 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-02-04 13:21:20,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:21:20,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 13:21:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:20,431 INFO L225 Difference]: With dead ends: 81 [2018-02-04 13:21:20,431 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 13:21:20,431 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 13:21:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 13:21:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 13:21:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 13:21:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-02-04 13:21:20,434 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 35 [2018-02-04 13:21:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:20,435 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-02-04 13:21:20,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:21:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-02-04 13:21:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 13:21:20,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:20,435 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 13:21:20,436 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 13:21:20,436 INFO L82 PathProgramCache]: Analyzing trace with hash 730389066, now seen corresponding path program 1 times [2018-02-04 13:21:20,436 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:20,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:20,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:20,437 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:20,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:20,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:20,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:20,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 13:21:20,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:21:20,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:21:20,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:21:20,537 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 10 states. [2018-02-04 13:21:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:20,696 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-02-04 13:21:20,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:21:20,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-04 13:21:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:20,697 INFO L225 Difference]: With dead ends: 80 [2018-02-04 13:21:20,697 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 13:21:20,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:21:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 13:21:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 13:21:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 13:21:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-02-04 13:21:20,700 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 37 [2018-02-04 13:21:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:20,700 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-02-04 13:21:20,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:21:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-02-04 13:21:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 13:21:20,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:20,701 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 13:21:20,701 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 13:21:20,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324108, now seen corresponding path program 1 times [2018-02-04 13:21:20,701 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:20,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:20,702 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:20,702 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:20,702 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:20,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:20,839 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 13:21:20,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:20,839 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:21:20,853 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:20,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:20,917 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 13:21:20,918 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 13:21:20,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:20,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:20,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:20,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 13:21:20,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 13:21:20,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:20,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:20,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-04 13:21:21,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-04 13:21:21,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 13:21:21,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:21:21,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 13:21:21,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-02-04 13:21:21,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-02-04 13:21:21,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:21:21,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-02-04 13:21:21,111 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 13:21:21,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:21,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2018-02-04 13:21:21,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 13:21:21,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 13:21:21,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:21:21,135 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 20 states. [2018-02-04 13:21:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:21,517 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-02-04 13:21:21,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 13:21:21,517 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-02-04 13:21:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:21,518 INFO L225 Difference]: With dead ends: 81 [2018-02-04 13:21:21,518 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 13:21:21,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:21:21,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 13:21:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 13:21:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 13:21:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-02-04 13:21:21,521 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 40 [2018-02-04 13:21:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:21,521 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-02-04 13:21:21,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 13:21:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-02-04 13:21:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 13:21:21,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:21,522 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 13:21:21,522 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 13:21:21,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324109, now seen corresponding path program 1 times [2018-02-04 13:21:21,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:21,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:21,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:21,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:21,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:21,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:21,685 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 13:21:21,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:21,685 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:21:21,690 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:21,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:21,735 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 13:21:21,737 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 13:21:21,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,744 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 13:21:21,746 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 13:21:21,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-02-04 13:21:21,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:21,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:21,804 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 13:21:21,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,812 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 13:21:21,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-02-04 13:21:21,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-02-04 13:21:21,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-02-04 13:21:21,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-02-04 13:21:21,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-04 13:21:21,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:21,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:21:21,967 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-02-04 13:21:22,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-02-04 13:21:22,013 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 30 treesize of output 23 [2018-02-04 13:21:22,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:22,029 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 23 treesize of output 14 [2018-02-04 13:21:22,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:22,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-02-04 13:21:22,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:22,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:22,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-02-04 13:21:22,066 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 22 treesize of output 15 [2018-02-04 13:21:22,066 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:22,074 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 15 treesize of output 8 [2018-02-04 13:21:22,075 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:22,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-02-04 13:21:22,083 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:22,085 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:22,089 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 13:21:22,089 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-02-04 13:21:22,108 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 13:21:22,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:22,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-02-04 13:21:22,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 13:21:22,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 13:21:22,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=405, Unknown=1, NotChecked=0, Total=462 [2018-02-04 13:21:22,126 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 22 states. [2018-02-04 13:21:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:22,728 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-02-04 13:21:22,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 13:21:22,728 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-02-04 13:21:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:22,729 INFO L225 Difference]: With dead ends: 80 [2018-02-04 13:21:22,729 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 13:21:22,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=866, Unknown=1, NotChecked=0, Total=1056 [2018-02-04 13:21:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 13:21:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-02-04 13:21:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 13:21:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-04 13:21:22,731 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 40 [2018-02-04 13:21:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:22,731 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-04 13:21:22,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 13:21:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-04 13:21:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 13:21:22,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:22,732 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 13:21:22,732 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 13:21:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1242227968, now seen corresponding path program 1 times [2018-02-04 13:21:22,732 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:22,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:22,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:22,733 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:22,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:22,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:22,761 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 13:21:22,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:22,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:21:22,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:21:22,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:21:22,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:21:22,761 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2018-02-04 13:21:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:22,773 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-04 13:21:22,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:21:22,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-04 13:21:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:22,774 INFO L225 Difference]: With dead ends: 96 [2018-02-04 13:21:22,774 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 13:21:22,774 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 13:21:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 13:21:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-02-04 13:21:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 13:21:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-04 13:21:22,775 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 42 [2018-02-04 13:21:22,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:22,776 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-04 13:21:22,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:21:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-04 13:21:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 13:21:22,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:22,776 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 13:21:22,776 INFO L371 AbstractCegarLoop]: === Iteration 21 === [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 13:21:22,776 INFO L82 PathProgramCache]: Analyzing trace with hash -221032996, now seen corresponding path program 1 times [2018-02-04 13:21:22,776 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:22,776 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:22,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:22,777 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:22,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 13:21:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 13:21:22,804 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 13:21:22,815 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 13:21:22,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:21:22 BoogieIcfgContainer [2018-02-04 13:21:22,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:21:22,833 INFO L168 Benchmark]: Toolchain (without parser) took 6141.51 ms. Allocated memory was 407.9 MB in the beginning and 716.2 MB in the end (delta: 308.3 MB). Free memory was 364.8 MB in the beginning and 447.5 MB in the end (delta: -82.7 MB). Peak memory consumption was 225.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:21:22,834 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 407.9 MB. Free memory is still 371.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:21:22,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.07 ms. Allocated memory is still 407.9 MB. Free memory was 364.8 MB in the beginning and 354.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:21:22,834 INFO L168 Benchmark]: Boogie Preprocessor took 28.87 ms. Allocated memory is still 407.9 MB. Free memory was 354.2 MB in the beginning and 352.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:21:22,835 INFO L168 Benchmark]: RCFGBuilder took 340.98 ms. Allocated memory is still 407.9 MB. Free memory was 352.9 MB in the beginning and 323.0 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 5.3 GB. [2018-02-04 13:21:22,835 INFO L168 Benchmark]: TraceAbstraction took 5615.10 ms. Allocated memory was 407.9 MB in the beginning and 716.2 MB in the end (delta: 308.3 MB). Free memory was 323.0 MB in the beginning and 447.5 MB in the end (delta: -124.5 MB). Peak memory consumption was 183.7 MB. Max. memory is 5.3 GB. [2018-02-04 13:21:22,836 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.17 ms. Allocated memory is still 407.9 MB. Free memory is still 371.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.07 ms. Allocated memory is still 407.9 MB. Free memory was 364.8 MB in the beginning and 354.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.87 ms. Allocated memory is still 407.9 MB. Free memory was 354.2 MB in the beginning and 352.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 340.98 ms. Allocated memory is still 407.9 MB. Free memory was 352.9 MB in the beginning and 323.0 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5615.10 ms. Allocated memory was 407.9 MB in the beginning and 716.2 MB in the end (delta: 308.3 MB). Free memory was 323.0 MB in the beginning and 447.5 MB in the end (delta: -124.5 MB). Peak memory consumption was 183.7 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, 5.5s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1310 SDtfs, 1068 SDslu, 3358 SDs, 0 SdLazy, 2840 SolverSat, 158 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 108 SyntacticMatches, 12 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 83 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 641 ConstructedInterpolants, 13 QuantifiedInterpolants, 156146 SizeOfPredicates, 42 NumberOfNonLiveVariables, 610 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 16/52 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-21-22-841.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-21-22-841.csv Received shutdown request...