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/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:05:10,760 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:05:10,762 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:05:10,772 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:05:10,772 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:05:10,773 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:05:10,774 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:05:10,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:05:10,776 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:05:10,777 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:05:10,777 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:05:10,777 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:05:10,778 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:05:10,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:05:10,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:05:10,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:05:10,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:05:10,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:05:10,784 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:05:10,785 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:05:10,787 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:05:10,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:05:10,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:05:10,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:05:10,789 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:05:10,791 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:05:10,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:05:10,792 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:05:10,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:05:10,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:05:10,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:05:10,793 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 12:05:10,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:05:10,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:05:10,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:05:10,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:05:10,805 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:05:10,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:05:10,805 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:05:10,805 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:05:10,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:05:10,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:05:10,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:05:10,806 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:05:10,806 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:05:10,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:05:10,806 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:05:10,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:05:10,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:05:10,807 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:05:10,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:05:10,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:05:10,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:05:10,807 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:05:10,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:05:10,808 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:05:10,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:05:10,851 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:05:10,857 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:05:10,858 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:05:10,858 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:05:10,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:05:11,012 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:05:11,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:05:11,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:05:11,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:05:11,019 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:05:11,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:05:11" (1/1) ... [2018-02-04 12:05:11,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d61a4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11, skipping insertion in model container [2018-02-04 12:05:11,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:05:11" (1/1) ... [2018-02-04 12:05:11,037 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:05:11,080 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:05:11,164 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:05:11,177 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:05:11,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11 WrapperNode [2018-02-04 12:05:11,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:05:11,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:05:11,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:05:11,182 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:05:11,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11" (1/1) ... [2018-02-04 12:05:11,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11" (1/1) ... [2018-02-04 12:05:11,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11" (1/1) ... [2018-02-04 12:05:11,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11" (1/1) ... [2018-02-04 12:05:11,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11" (1/1) ... [2018-02-04 12:05:11,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11" (1/1) ... [2018-02-04 12:05:11,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11" (1/1) ... [2018-02-04 12:05:11,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:05:11,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:05:11,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:05:11,206 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:05:11,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11" (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 12:05:11,243 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:05:11,243 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:05:11,243 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-02-04 12:05:11,243 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:05:11,244 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:05:11,244 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:05:11,244 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:05:11,244 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:05:11,244 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:05:11,244 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:05:11,244 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-02-04 12:05:11,244 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:05:11,244 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:05:11,244 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:05:11,483 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:05:11,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:05:11 BoogieIcfgContainer [2018-02-04 12:05:11,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:05:11,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:05:11,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:05:11,486 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:05:11,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:05:11" (1/3) ... [2018-02-04 12:05:11,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcd4720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:05:11, skipping insertion in model container [2018-02-04 12:05:11,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:11" (2/3) ... [2018-02-04 12:05:11,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcd4720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:05:11, skipping insertion in model container [2018-02-04 12:05:11,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:05:11" (3/3) ... [2018-02-04 12:05:11,490 INFO L107 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:05:11,497 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:05:11,504 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-04 12:05:11,534 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:05:11,534 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:05:11,534 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:05:11,534 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:05:11,534 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:05:11,534 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:05:11,534 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:05:11,535 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:05:11,535 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:05:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-02-04 12:05:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:05:11,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:11,552 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:11,553 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash -456745945, now seen corresponding path program 1 times [2018-02-04 12:05:11,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:11,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:11,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:11,591 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:11,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:11,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:11,746 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 12:05:11,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:11,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:05:11,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:05:11,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:05:11,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:05:11,826 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-02-04 12:05:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:11,906 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 12:05:11,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:05:11,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 12:05:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:11,914 INFO L225 Difference]: With dead ends: 77 [2018-02-04 12:05:11,914 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 12:05:11,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:05:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 12:05:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 12:05:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 12:05:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 12:05:11,941 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2018-02-04 12:05:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:11,942 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 12:05:11,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:05:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 12:05:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:05:11,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:11,942 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:11,942 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:11,943 INFO L82 PathProgramCache]: Analyzing trace with hash -456745944, now seen corresponding path program 1 times [2018-02-04 12:05:11,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:11,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:11,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:11,944 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:11,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:11,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:12,055 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 12:05:12,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:12,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:05:12,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:05:12,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:05:12,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:05:12,057 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-02-04 12:05:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:12,262 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-02-04 12:05:12,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:05:12,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-04 12:05:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:12,266 INFO L225 Difference]: With dead ends: 96 [2018-02-04 12:05:12,266 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 12:05:12,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:05:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 12:05:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-02-04 12:05:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 12:05:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-04 12:05:12,274 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 18 [2018-02-04 12:05:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:12,274 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-04 12:05:12,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:05:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-04 12:05:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:05:12,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:12,275 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:12,275 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222418, now seen corresponding path program 1 times [2018-02-04 12:05:12,276 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:12,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:12,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:12,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:12,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:12,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:12,318 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 12:05:12,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:12,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:05:12,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:05:12,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:05:12,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:05:12,319 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2018-02-04 12:05:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:12,350 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-04 12:05:12,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:05:12,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 12:05:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:12,351 INFO L225 Difference]: With dead ends: 80 [2018-02-04 12:05:12,351 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 12:05:12,352 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 12:05:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 12:05:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 12:05:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 12:05:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-04 12:05:12,355 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2018-02-04 12:05:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:12,355 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-04 12:05:12,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:05:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-04 12:05:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:05:12,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:12,356 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:12,356 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222417, now seen corresponding path program 1 times [2018-02-04 12:05:12,356 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:12,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:12,357 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:12,357 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:12,357 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:12,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:12,454 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 12:05:12,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:12,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:05:12,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:05:12,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:05:12,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:05:12,456 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2018-02-04 12:05:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:12,632 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-02-04 12:05:12,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:05:12,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 12:05:12,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:12,637 INFO L225 Difference]: With dead ends: 97 [2018-02-04 12:05:12,637 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 12:05:12,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:05:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 12:05:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-02-04 12:05:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 12:05:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-02-04 12:05:12,642 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-02-04 12:05:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:12,643 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-02-04 12:05:12,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:05:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-02-04 12:05:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:05:12,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:12,643 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] [2018-02-04 12:05:12,643 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1183954355, now seen corresponding path program 1 times [2018-02-04 12:05:12,644 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:12,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:12,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:12,645 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:12,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:12,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:12,693 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 12:05:12,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:12,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:05:12,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:05:12,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:05:12,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:05:12,694 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 6 states. [2018-02-04 12:05:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:12,769 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2018-02-04 12:05:12,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:05:12,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 12:05:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:12,770 INFO L225 Difference]: With dead ends: 128 [2018-02-04 12:05:12,770 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 12:05:12,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:05:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 12:05:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-02-04 12:05:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 12:05:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-02-04 12:05:12,779 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 23 [2018-02-04 12:05:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:12,780 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-02-04 12:05:12,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:05:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-02-04 12:05:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:05:12,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:12,781 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:12,781 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:12,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1662425565, now seen corresponding path program 1 times [2018-02-04 12:05:12,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:12,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:12,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:12,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:12,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:12,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:12,884 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:12,884 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 12:05:12,890 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:12,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:12,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:05:12,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 11 [2018-02-04 12:05:12,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:05:12,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:05:12,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:05:12,957 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 11 states. [2018-02-04 12:05:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:13,199 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-04 12:05:13,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:05:13,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 12:05:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:13,201 INFO L225 Difference]: With dead ends: 126 [2018-02-04 12:05:13,201 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 12:05:13,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:05:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 12:05:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2018-02-04 12:05:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 12:05:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-04 12:05:13,207 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 23 [2018-02-04 12:05:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:13,208 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-04 12:05:13,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:05:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-04 12:05:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:05:13,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:13,208 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] [2018-02-04 12:05:13,209 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:13,209 INFO L82 PathProgramCache]: Analyzing trace with hash -404393547, now seen corresponding path program 1 times [2018-02-04 12:05:13,209 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:13,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:13,210 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:13,210 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:13,210 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:13,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:13,255 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 12:05:13,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:13,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:05:13,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:05:13,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:05:13,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:05:13,256 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 6 states. [2018-02-04 12:05:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:13,316 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-02-04 12:05:13,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:05:13,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 12:05:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:13,316 INFO L225 Difference]: With dead ends: 117 [2018-02-04 12:05:13,317 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 12:05:13,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:05:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 12:05:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-02-04 12:05:13,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 12:05:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-02-04 12:05:13,320 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 23 [2018-02-04 12:05:13,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:13,320 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-02-04 12:05:13,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:05:13,320 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-02-04 12:05:13,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:05:13,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:13,321 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:13,321 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1044193829, now seen corresponding path program 1 times [2018-02-04 12:05:13,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:13,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:13,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:13,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:13,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:13,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:13,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:13,422 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 12:05:13,427 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:13,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:13,468 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 12:05:13,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:13,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-04 12:05:13,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:13,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:13,495 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 12:05:13,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,504 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 19 [2018-02-04 12:05:13,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 12:05:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:13,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:13,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 12:05:13,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:05:13,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:05:13,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:05:13,625 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2018-02-04 12:05:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:13,876 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-02-04 12:05:13,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:05:13,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-02-04 12:05:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:13,877 INFO L225 Difference]: With dead ends: 112 [2018-02-04 12:05:13,877 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 12:05:13,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:05:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 12:05:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2018-02-04 12:05:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 12:05:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-02-04 12:05:13,880 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-02-04 12:05:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:13,880 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-02-04 12:05:13,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:05:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-02-04 12:05:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:05:13,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:13,881 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:13,881 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:13,881 INFO L82 PathProgramCache]: Analyzing trace with hash 186672598, now seen corresponding path program 1 times [2018-02-04 12:05:13,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:13,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:13,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:13,882 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:13,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:13,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:13,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:13,920 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 12:05:13,932 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:13,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:13,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:13,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 12:05:13,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:05:13,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:05:13,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:05:14,000 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 8 states. [2018-02-04 12:05:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:14,094 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2018-02-04 12:05:14,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:05:14,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 12:05:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:14,095 INFO L225 Difference]: With dead ends: 176 [2018-02-04 12:05:14,095 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 12:05:14,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:05:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 12:05:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 124. [2018-02-04 12:05:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 12:05:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-02-04 12:05:14,101 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 28 [2018-02-04 12:05:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:14,101 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-02-04 12:05:14,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:05:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-02-04 12:05:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:05:14,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:14,102 INFO L351 BasicCegarLoop]: trace histogram [3, 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 12:05:14,102 INFO L371 AbstractCegarLoop]: === Iteration 10 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:14,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1928191573, now seen corresponding path program 2 times [2018-02-04 12:05:14,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:14,102 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:14,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:14,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:14,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:14,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:14,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:14,388 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:05:14,395 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:05:14,412 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 12:05:14,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:14,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:14,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:14,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:14,423 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 12:05:14,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:14,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:14,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-04 12:05:14,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:14,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:14,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:05:14,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:14,497 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 19 [2018-02-04 12:05:14,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:14,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:05:14,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 [2018-02-04 12:05:14,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:14,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:14,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:14,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:05:14,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:14,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-02-04 12:05:14,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:14,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:05:14,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2018-02-04 12:05:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 12:05:14,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:05:14,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2018-02-04 12:05:14,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:05:14,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:05:14,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:05:14,744 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 19 states. [2018-02-04 12:05:15,119 WARN L146 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 43 DAG size of output 42 [2018-02-04 12:05:15,725 WARN L146 SmtUtils]: Spent 347ms on a formula simplification. DAG size of input: 62 DAG size of output 61 [2018-02-04 12:05:16,158 WARN L146 SmtUtils]: Spent 291ms on a formula simplification. DAG size of input: 65 DAG size of output 58 [2018-02-04 12:05:16,591 WARN L146 SmtUtils]: Spent 296ms on a formula simplification. DAG size of input: 61 DAG size of output 60 [2018-02-04 12:05:16,928 WARN L146 SmtUtils]: Spent 291ms on a formula simplification. DAG size of input: 63 DAG size of output 58 [2018-02-04 12:05:17,195 WARN L146 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 40 DAG size of output 39 [2018-02-04 12:05:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:17,507 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2018-02-04 12:05:17,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:05:17,507 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-02-04 12:05:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:17,508 INFO L225 Difference]: With dead ends: 162 [2018-02-04 12:05:17,508 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 12:05:17,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:05:17,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 12:05:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 121. [2018-02-04 12:05:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 12:05:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-02-04 12:05:17,515 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 33 [2018-02-04 12:05:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:17,515 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-02-04 12:05:17,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:05:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-02-04 12:05:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 12:05:17,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:17,517 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 12:05:17,517 INFO L371 AbstractCegarLoop]: === Iteration 11 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -355603392, now seen corresponding path program 1 times [2018-02-04 12:05:17,517 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:17,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:17,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:17,518 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:05:17,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:17,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 12:05:17,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:17,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:05:17,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:05:17,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:05:17,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:05:17,579 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 9 states. [2018-02-04 12:05:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:17,714 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2018-02-04 12:05:17,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:05:17,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-04 12:05:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:17,715 INFO L225 Difference]: With dead ends: 158 [2018-02-04 12:05:17,715 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 12:05:17,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:05:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 12:05:17,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2018-02-04 12:05:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 12:05:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-02-04 12:05:17,719 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 34 [2018-02-04 12:05:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:17,719 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-02-04 12:05:17,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:05:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-02-04 12:05:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:05:17,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:17,721 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:17,721 INFO L371 AbstractCegarLoop]: === Iteration 12 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:17,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1116063411, now seen corresponding path program 1 times [2018-02-04 12:05:17,721 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:17,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:17,722 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:17,722 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:17,722 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:17,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 12:05:17,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:17,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:05:17,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:05:17,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:05:17,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:05:17,754 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 3 states. [2018-02-04 12:05:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:17,759 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-04 12:05:17,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:05:17,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-02-04 12:05:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:17,761 INFO L225 Difference]: With dead ends: 126 [2018-02-04 12:05:17,761 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 12:05:17,761 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 12:05:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 12:05:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 12:05:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 12:05:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-02-04 12:05:17,765 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 38 [2018-02-04 12:05:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:17,765 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-02-04 12:05:17,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:05:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-02-04 12:05:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:05:17,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:17,767 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:17,767 INFO L371 AbstractCegarLoop]: === Iteration 13 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:17,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1116072442, now seen corresponding path program 1 times [2018-02-04 12:05:17,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:17,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:17,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:17,768 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:17,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:17,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 12:05:17,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:17,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:05:17,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:05:17,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:05:17,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:05:17,846 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 11 states. [2018-02-04 12:05:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:17,940 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-04 12:05:17,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:05:17,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-04 12:05:17,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:17,941 INFO L225 Difference]: With dead ends: 125 [2018-02-04 12:05:17,941 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 12:05:17,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:05:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 12:05:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-02-04 12:05:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 12:05:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-02-04 12:05:17,944 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 38 [2018-02-04 12:05:17,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:17,944 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-02-04 12:05:17,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:05:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-02-04 12:05:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 12:05:17,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:17,945 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2018-02-04 12:05:17,945 INFO L371 AbstractCegarLoop]: === Iteration 14 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:17,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1390751146, now seen corresponding path program 1 times [2018-02-04 12:05:17,945 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:17,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:17,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:17,946 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:17,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:17,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 12:05:17,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:17,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:05:17,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:05:17,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:05:18,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:05:18,000 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 9 states. [2018-02-04 12:05:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:18,065 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-02-04 12:05:18,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:05:18,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-04 12:05:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:18,066 INFO L225 Difference]: With dead ends: 143 [2018-02-04 12:05:18,066 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 12:05:18,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:05:18,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 12:05:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-02-04 12:05:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 12:05:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2018-02-04 12:05:18,069 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 42 [2018-02-04 12:05:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:18,070 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2018-02-04 12:05:18,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:05:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-02-04 12:05:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 12:05:18,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:18,071 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:18,071 INFO L371 AbstractCegarLoop]: === Iteration 15 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -363955689, now seen corresponding path program 1 times [2018-02-04 12:05:18,071 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:18,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:18,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:18,072 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:18,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:18,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:18,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:18,356 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:05:18,360 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:18,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:18,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:18,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:05:18,401 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:18,401 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:18,402 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 12:05:18,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:05:18,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 12:05:18,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 12:05:18,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-02-04 12:05:18,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 12:05:18,454 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 12:05:18,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:05:18,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-02-04 12:05:18,503 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 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-04 12:05:18,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 12:05:18,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 12:05:18,510 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:18,513 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-02-04 12:05:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:18,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:18,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-02-04 12:05:18,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 12:05:18,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 12:05:18,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:05:18,545 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 24 states. [2018-02-04 12:05:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:19,640 INFO L93 Difference]: Finished difference Result 253 states and 281 transitions. [2018-02-04 12:05:19,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 12:05:19,640 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-02-04 12:05:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:19,642 INFO L225 Difference]: With dead ends: 253 [2018-02-04 12:05:19,642 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 12:05:19,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=614, Invalid=1936, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 12:05:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 12:05:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 147. [2018-02-04 12:05:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 12:05:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-02-04 12:05:19,647 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 44 [2018-02-04 12:05:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:19,647 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-02-04 12:05:19,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 12:05:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-02-04 12:05:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 12:05:19,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:19,648 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:19,648 INFO L371 AbstractCegarLoop]: === Iteration 16 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2022275116, now seen corresponding path program 1 times [2018-02-04 12:05:19,648 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:19,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:19,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:19,650 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:19,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:19,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 12:05:19,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:19,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:05:19,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:05:19,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:05:19,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:05:19,823 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 8 states. [2018-02-04 12:05:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:19,925 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-02-04 12:05:19,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:05:19,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 12:05:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:19,926 INFO L225 Difference]: With dead ends: 146 [2018-02-04 12:05:19,926 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 12:05:19,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:05:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 12:05:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-04 12:05:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 12:05:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-02-04 12:05:19,928 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 46 [2018-02-04 12:05:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:19,928 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-02-04 12:05:19,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:05:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-02-04 12:05:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 12:05:19,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:19,929 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2018-02-04 12:05:19,929 INFO L371 AbstractCegarLoop]: === Iteration 17 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:19,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1787354498, now seen corresponding path program 1 times [2018-02-04 12:05:19,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:19,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:19,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:19,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:19,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:19,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 12:05:20,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:20,003 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:05:20,008 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:20,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 12:05:20,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:05:20,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2018-02-04 12:05:20,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:05:20,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:05:20,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:05:20,051 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 13 states. [2018-02-04 12:05:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:20,197 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-04 12:05:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:05:20,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-02-04 12:05:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:20,197 INFO L225 Difference]: With dead ends: 88 [2018-02-04 12:05:20,198 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 12:05:20,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:05:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 12:05:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-02-04 12:05:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 12:05:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-04 12:05:20,199 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 47 [2018-02-04 12:05:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:20,199 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-04 12:05:20,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:05:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-04 12:05:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 12:05:20,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:20,200 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:20,200 INFO L371 AbstractCegarLoop]: === Iteration 18 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1878068012, now seen corresponding path program 2 times [2018-02-04 12:05:20,200 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:20,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:20,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:20,200 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:20,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:20,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 12:05:20,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:20,274 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:05:20,279 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:05:20,298 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:05:20,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:20,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 12:05:20,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:20,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-02-04 12:05:20,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:05:20,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:05:20,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:05:20,363 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 18 states. [2018-02-04 12:05:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:20,575 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2018-02-04 12:05:20,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 12:05:20,575 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-02-04 12:05:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:20,576 INFO L225 Difference]: With dead ends: 129 [2018-02-04 12:05:20,576 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 12:05:20,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:05:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 12:05:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-02-04 12:05:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 12:05:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 12:05:20,578 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 55 [2018-02-04 12:05:20,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:20,578 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 12:05:20,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:05:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 12:05:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 12:05:20,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:20,579 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:20,579 INFO L371 AbstractCegarLoop]: === Iteration 19 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash 53164877, now seen corresponding path program 3 times [2018-02-04 12:05:20,579 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:20,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:20,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:20,580 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:05:20,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:20,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 12:05:20,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:20,664 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:05:20,669 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:05:20,683 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 12:05:20,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:20,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 12:05:20,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:05:20,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2018-02-04 12:05:20,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 12:05:20,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 12:05:20,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:05:20,781 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 14 states. [2018-02-04 12:05:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:20,896 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-04 12:05:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:05:20,896 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-02-04 12:05:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:20,897 INFO L225 Difference]: With dead ends: 88 [2018-02-04 12:05:20,897 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:05:20,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:05:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:05:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:05:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:05:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:05:20,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-02-04 12:05:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:20,897 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:05:20,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 12:05:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:05:20,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:05:20,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:05:20 BoogieIcfgContainer [2018-02-04 12:05:20,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:05:20,901 INFO L168 Benchmark]: Toolchain (without parser) took 9888.86 ms. Allocated memory was 402.7 MB in the beginning and 744.5 MB in the end (delta: 341.8 MB). Free memory was 359.1 MB in the beginning and 467.7 MB in the end (delta: -108.6 MB). Peak memory consumption was 233.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:05:20,902 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 402.7 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:05:20,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.16 ms. Allocated memory is still 402.7 MB. Free memory was 359.1 MB in the beginning and 348.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:05:20,902 INFO L168 Benchmark]: Boogie Preprocessor took 23.76 ms. Allocated memory is still 402.7 MB. Free memory was 348.6 MB in the beginning and 345.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:05:20,902 INFO L168 Benchmark]: RCFGBuilder took 277.66 ms. Allocated memory is still 402.7 MB. Free memory was 345.9 MB in the beginning and 320.8 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-02-04 12:05:20,902 INFO L168 Benchmark]: TraceAbstraction took 9416.26 ms. Allocated memory was 402.7 MB in the beginning and 744.5 MB in the end (delta: 341.8 MB). Free memory was 320.8 MB in the beginning and 467.7 MB in the end (delta: -146.9 MB). Peak memory consumption was 194.9 MB. Max. memory is 5.3 GB. [2018-02-04 12:05:20,903 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.18 ms. Allocated memory is still 402.7 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.16 ms. Allocated memory is still 402.7 MB. Free memory was 359.1 MB in the beginning and 348.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.76 ms. Allocated memory is still 402.7 MB. Free memory was 348.6 MB in the beginning and 345.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 277.66 ms. Allocated memory is still 402.7 MB. Free memory was 345.9 MB in the beginning and 320.8 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9416.26 ms. Allocated memory was 402.7 MB in the beginning and 744.5 MB in the end (delta: 341.8 MB). Free memory was 320.8 MB in the beginning and 467.7 MB in the end (delta: -146.9 MB). Peak memory consumption was 194.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 23 error locations. SAFE Result, 9.3s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 994 SDtfs, 4354 SDslu, 3469 SDs, 0 SdLazy, 2764 SolverSat, 468 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 296 SyntacticMatches, 11 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 344 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 944 NumberOfCodeBlocks, 916 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 917 ConstructedInterpolants, 42 QuantifiedInterpolants, 235423 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1048 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 216/280 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-05-20-907.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-05-20-907.csv Received shutdown request...