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-a74eeac-m [2018-02-02 18:24:32,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:24:32,762 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:24:32,774 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:24:32,774 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:24:32,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:24:32,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:24:32,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:24:32,780 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:24:32,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:24:32,782 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:24:32,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:24:32,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:24:32,784 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:24:32,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:24:32,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:24:32,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:24:32,790 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:24:32,791 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:24:32,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:24:32,794 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:24:32,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:24:32,795 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:24:32,796 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:24:32,796 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:24:32,798 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:24:32,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:24:32,798 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:24:32,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:24:32,799 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:24:32,799 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:24:32,800 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-02 18:24:32,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:24:32,816 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:24:32,817 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:24:32,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:24:32,818 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:24:32,818 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:24:32,818 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:24:32,818 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:24:32,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:24:32,819 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:24:32,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:24:32,819 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:24:32,819 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:24:32,819 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:24:32,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:24:32,820 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:24:32,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:24:32,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:24:32,820 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:24:32,820 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:24:32,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:24:32,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:24:32,821 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:24:32,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:24:32,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:24:32,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:24:32,863 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:24:32,866 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:24:32,867 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:24:32,868 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:24:32,869 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-02 18:24:33,095 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:24:33,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:24:33,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:24:33,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:24:33,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:24:33,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:24:33" (1/1) ... [2018-02-02 18:24:33,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad95545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33, skipping insertion in model container [2018-02-02 18:24:33,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:24:33" (1/1) ... [2018-02-02 18:24:33,188 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:24:33,218 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:24:33,309 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:24:33,326 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:24:33,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33 WrapperNode [2018-02-02 18:24:33,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:24:33,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:24:33,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:24:33,333 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:24:33,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33" (1/1) ... [2018-02-02 18:24:33,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33" (1/1) ... [2018-02-02 18:24:33,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33" (1/1) ... [2018-02-02 18:24:33,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33" (1/1) ... [2018-02-02 18:24:33,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33" (1/1) ... [2018-02-02 18:24:33,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33" (1/1) ... [2018-02-02 18:24:33,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33" (1/1) ... [2018-02-02 18:24:33,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:24:33,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:24:33,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:24:33,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:24:33,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33" (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-02 18:24:33,392 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:24:33,392 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:24:33,392 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-02-02 18:24:33,393 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:24:33,393 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:24:33,393 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:24:33,393 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:24:33,393 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:24:33,393 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:24:33,393 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:24:33,393 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-02-02 18:24:33,393 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:24:33,393 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:24:33,393 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:24:33,589 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:24:33,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:24:33 BoogieIcfgContainer [2018-02-02 18:24:33,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:24:33,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:24:33,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:24:33,593 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:24:33,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:24:33" (1/3) ... [2018-02-02 18:24:33,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c8ed5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:24:33, skipping insertion in model container [2018-02-02 18:24:33,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:24:33" (2/3) ... [2018-02-02 18:24:33,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c8ed5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:24:33, skipping insertion in model container [2018-02-02 18:24:33,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:24:33" (3/3) ... [2018-02-02 18:24:33,596 INFO L107 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-02-02 18:24:33,604 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:24:33,608 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 18:24:33,641 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:24:33,641 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:24:33,641 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:24:33,641 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:24:33,641 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:24:33,641 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:24:33,641 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:24:33,642 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:24:33,642 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:24:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-02-02 18:24:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 18:24:33,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:33,664 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-02 18:24:33,664 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-02 18:24:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash -456745945, now seen corresponding path program 1 times [2018-02-02 18:24:33,670 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:33,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:33,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:33,717 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:33,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:33,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:33,893 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-02 18:24:33,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:33,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:24:33,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:24:33,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:24:33,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:24:33,958 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-02-02 18:24:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:34,062 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-02 18:24:34,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:24:34,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 18:24:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:34,069 INFO L225 Difference]: With dead ends: 77 [2018-02-02 18:24:34,069 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 18:24:34,070 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-02 18:24:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 18:24:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 18:24:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 18:24:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-02 18:24:34,097 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2018-02-02 18:24:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:34,097 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-02 18:24:34,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:24:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-02 18:24:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 18:24:34,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:34,098 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-02 18:24:34,098 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-02 18:24:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash -456745944, now seen corresponding path program 1 times [2018-02-02 18:24:34,098 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:34,098 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:34,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:34,100 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:34,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:34,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:34,237 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-02 18:24:34,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:34,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:24:34,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:24:34,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:24:34,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:24:34,244 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-02-02 18:24:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:34,502 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-02-02 18:24:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:24:34,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-02 18:24:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:34,505 INFO L225 Difference]: With dead ends: 96 [2018-02-02 18:24:34,505 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 18:24:34,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:24:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 18:24:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-02-02 18:24:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 18:24:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-02 18:24:34,512 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 18 [2018-02-02 18:24:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:34,513 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-02 18:24:34,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:24:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-02 18:24:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 18:24:34,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:34,514 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-02 18:24:34,514 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-02 18:24:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222418, now seen corresponding path program 1 times [2018-02-02 18:24:34,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:34,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:34,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:34,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:34,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:34,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:34,552 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-02 18:24:34,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:34,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:24:34,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:24:34,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:24:34,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:24:34,553 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2018-02-02 18:24:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:34,586 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-02 18:24:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:24:34,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-02 18:24:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:34,590 INFO L225 Difference]: With dead ends: 80 [2018-02-02 18:24:34,591 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 18:24:34,591 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-02 18:24:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 18:24:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 18:24:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 18:24:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-02 18:24:34,596 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2018-02-02 18:24:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:34,596 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-02 18:24:34,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:24:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-02 18:24:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 18:24:34,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:34,597 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-02 18:24:34,597 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-02 18:24:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222417, now seen corresponding path program 1 times [2018-02-02 18:24:34,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:34,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:34,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:34,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:34,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:34,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:34,685 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-02 18:24:34,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:34,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:24:34,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:24:34,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:24:34,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:24:34,686 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2018-02-02 18:24:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:34,849 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-02-02 18:24:34,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:24:34,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-02 18:24:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:34,850 INFO L225 Difference]: With dead ends: 97 [2018-02-02 18:24:34,850 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 18:24:34,850 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-02 18:24:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 18:24:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-02-02 18:24:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 18:24:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-02-02 18:24:34,854 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-02-02 18:24:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:34,854 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-02-02 18:24:34,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:24:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-02-02 18:24:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:24:34,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:34,855 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-02 18:24:34,855 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-02 18:24:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1183954355, now seen corresponding path program 1 times [2018-02-02 18:24:34,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:34,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:34,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:34,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:34,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:34,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:34,911 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-02 18:24:34,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:34,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:24:34,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:24:34,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:24:34,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:24:34,912 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 6 states. [2018-02-02 18:24:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:35,008 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2018-02-02 18:24:35,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:24:35,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 18:24:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:35,010 INFO L225 Difference]: With dead ends: 128 [2018-02-02 18:24:35,010 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 18:24:35,010 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-02 18:24:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 18:24:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-02-02 18:24:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 18:24:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-02-02 18:24:35,017 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 23 [2018-02-02 18:24:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:35,017 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-02-02 18:24:35,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:24:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-02-02 18:24:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:24:35,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:35,018 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-02 18:24:35,018 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-02 18:24:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1662425565, now seen corresponding path program 1 times [2018-02-02 18:24:35,019 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:35,019 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:35,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:35,020 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:35,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:35,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:35,093 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-02 18:24:35,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:24:35,093 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-02 18:24:35,102 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:35,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:24:35,166 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-02 18:24:35,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:24:35,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 11 [2018-02-02 18:24:35,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:24:35,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:24:35,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:24:35,186 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 11 states. [2018-02-02 18:24:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:35,375 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-02 18:24:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:24:35,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 18:24:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:35,376 INFO L225 Difference]: With dead ends: 126 [2018-02-02 18:24:35,376 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 18:24:35,376 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-02 18:24:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 18:24:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2018-02-02 18:24:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 18:24:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-02 18:24:35,381 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 23 [2018-02-02 18:24:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:35,382 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-02 18:24:35,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:24:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-02 18:24:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:24:35,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:35,383 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-02 18:24:35,383 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-02 18:24:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash -404393547, now seen corresponding path program 1 times [2018-02-02 18:24:35,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:35,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:35,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:35,384 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:35,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:35,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:35,423 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-02 18:24:35,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:35,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:24:35,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:24:35,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:24:35,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:24:35,425 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 6 states. [2018-02-02 18:24:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:35,481 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-02-02 18:24:35,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:24:35,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 18:24:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:35,482 INFO L225 Difference]: With dead ends: 117 [2018-02-02 18:24:35,482 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 18:24:35,482 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-02 18:24:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 18:24:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-02-02 18:24:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 18:24:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-02-02 18:24:35,486 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 23 [2018-02-02 18:24:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:35,486 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-02-02 18:24:35,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:24:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-02-02 18:24:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:24:35,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:35,487 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-02 18:24:35,487 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-02 18:24:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1044193829, now seen corresponding path program 1 times [2018-02-02 18:24:35,487 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:35,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:35,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:35,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:35,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:35,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:35,603 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-02 18:24:35,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:24:35,604 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-02 18:24:35,611 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:35,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:24:35,645 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-02 18:24:35,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:35,651 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-02 18:24:35,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:35,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:24:35,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-02 18:24:35,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:24:35,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:24:35,666 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-02 18:24:35,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:35,672 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-02 18:24:35,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:35,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:24:35,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-02 18:24:35,759 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-02 18:24:35,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:24:35,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-02 18:24:35,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:24:35,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:24:35,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:24:35,779 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2018-02-02 18:24:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:36,050 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-02-02 18:24:36,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:24:36,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-02-02 18:24:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:36,051 INFO L225 Difference]: With dead ends: 112 [2018-02-02 18:24:36,051 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 18:24:36,052 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-02 18:24:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 18:24:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2018-02-02 18:24:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 18:24:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-02-02 18:24:36,055 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-02-02 18:24:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:36,055 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-02-02 18:24:36,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:24:36,055 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-02-02 18:24:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:24:36,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:36,056 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-02 18:24:36,056 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-02 18:24:36,056 INFO L82 PathProgramCache]: Analyzing trace with hash 186672598, now seen corresponding path program 1 times [2018-02-02 18:24:36,056 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:36,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:36,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:36,057 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:36,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:36,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:36,153 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-02 18:24:36,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:24:36,153 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-02 18:24:36,165 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:36,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:24:36,199 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-02 18:24:36,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:24:36,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-02 18:24:36,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:24:36,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:24:36,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:24:36,218 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 8 states. [2018-02-02 18:24:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:36,390 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2018-02-02 18:24:36,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:24:36,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-02 18:24:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:36,391 INFO L225 Difference]: With dead ends: 176 [2018-02-02 18:24:36,391 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 18:24:36,391 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-02 18:24:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 18:24:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 124. [2018-02-02 18:24:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 18:24:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-02-02 18:24:36,394 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 28 [2018-02-02 18:24:36,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:36,395 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-02-02 18:24:36,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:24:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-02-02 18:24:36,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 18:24:36,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:36,396 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-02 18:24:36,396 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-02 18:24:36,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1928191573, now seen corresponding path program 2 times [2018-02-02 18:24:36,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:36,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:36,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:36,397 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:36,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:36,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:36,662 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-02 18:24:36,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:24:36,663 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-02 18:24:36,671 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:24:36,684 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 18:24:36,684 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:24:36,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:24:36,691 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-02 18:24:36,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:36,697 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-02 18:24:36,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:36,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:24:36,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-02 18:24:36,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:24:36,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:24:36,750 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-02 18:24:36,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:36,762 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-02 18:24:36,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:36,773 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-02 18:24:36,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 [2018-02-02 18:24:36,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:24:36,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:24:36,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:24:36,818 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-02 18:24:36,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:36,836 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-02 18:24:36,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:36,846 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-02 18:24:36,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2018-02-02 18:24:37,023 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-02 18:24:37,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:24:37,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2018-02-02 18:24:37,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 18:24:37,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 18:24:37,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:24:37,046 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 19 states. [2018-02-02 18:24:37,430 WARN L146 SmtUtils]: Spent 277ms on a formula simplification. DAG size of input: 43 DAG size of output 42 [2018-02-02 18:24:38,094 WARN L146 SmtUtils]: Spent 352ms on a formula simplification. DAG size of input: 62 DAG size of output 61 [2018-02-02 18:24:38,482 WARN L146 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 65 DAG size of output 58 [2018-02-02 18:24:38,906 WARN L146 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 61 DAG size of output 60 [2018-02-02 18:24:39,245 WARN L146 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 63 DAG size of output 58 [2018-02-02 18:24:39,510 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 40 DAG size of output 39 [2018-02-02 18:24:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:39,806 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2018-02-02 18:24:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 18:24:39,807 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-02-02 18:24:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:39,808 INFO L225 Difference]: With dead ends: 162 [2018-02-02 18:24:39,808 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 18:24:39,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 18:24:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 18:24:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 121. [2018-02-02 18:24:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 18:24:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-02-02 18:24:39,813 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 33 [2018-02-02 18:24:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:39,813 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-02-02 18:24:39,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 18:24:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-02-02 18:24:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 18:24:39,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:39,814 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-02 18:24:39,815 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-02 18:24:39,815 INFO L82 PathProgramCache]: Analyzing trace with hash -355603392, now seen corresponding path program 1 times [2018-02-02 18:24:39,815 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:39,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:39,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:39,816 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:24:39,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:39,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:39,871 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-02 18:24:39,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:39,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:24:39,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:24:39,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:24:39,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:24:39,872 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 9 states. [2018-02-02 18:24:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:40,009 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2018-02-02 18:24:40,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:24:40,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-02 18:24:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:40,011 INFO L225 Difference]: With dead ends: 158 [2018-02-02 18:24:40,011 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 18:24:40,011 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-02 18:24:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 18:24:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2018-02-02 18:24:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 18:24:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-02-02 18:24:40,015 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 34 [2018-02-02 18:24:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:40,015 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-02-02 18:24:40,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:24:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-02-02 18:24:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:24:40,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:40,016 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-02 18:24:40,016 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-02 18:24:40,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1116063411, now seen corresponding path program 1 times [2018-02-02 18:24:40,017 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:40,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:40,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:40,018 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:40,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:40,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:40,037 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-02 18:24:40,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:40,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:24:40,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:24:40,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:24:40,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:24:40,038 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 3 states. [2018-02-02 18:24:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:40,043 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-02 18:24:40,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:24:40,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-02-02 18:24:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:40,044 INFO L225 Difference]: With dead ends: 126 [2018-02-02 18:24:40,044 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 18:24:40,045 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-02 18:24:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 18:24:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-02 18:24:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 18:24:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-02-02 18:24:40,048 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 38 [2018-02-02 18:24:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:40,048 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-02-02 18:24:40,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:24:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-02-02 18:24:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:24:40,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:40,049 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-02 18:24:40,049 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-02 18:24:40,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1116072442, now seen corresponding path program 1 times [2018-02-02 18:24:40,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:40,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:40,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:40,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:40,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:40,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:40,130 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-02 18:24:40,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:40,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 18:24:40,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:24:40,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:24:40,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:24:40,131 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 11 states. [2018-02-02 18:24:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:40,320 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-02 18:24:40,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:24:40,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-02 18:24:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:40,321 INFO L225 Difference]: With dead ends: 125 [2018-02-02 18:24:40,321 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 18:24:40,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:24:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 18:24:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-02-02 18:24:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 18:24:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-02-02 18:24:40,325 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 38 [2018-02-02 18:24:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:40,325 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-02-02 18:24:40,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:24:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-02-02 18:24:40,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 18:24:40,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:40,327 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-02 18:24:40,327 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-02 18:24:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1390751146, now seen corresponding path program 1 times [2018-02-02 18:24:40,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:40,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:40,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:40,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:40,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:40,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:40,402 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-02 18:24:40,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:40,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 18:24:40,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:24:40,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:24:40,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:24:40,403 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 9 states. [2018-02-02 18:24:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:40,467 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-02-02 18:24:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:24:40,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-02 18:24:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:40,468 INFO L225 Difference]: With dead ends: 143 [2018-02-02 18:24:40,468 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 18:24:40,469 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-02 18:24:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 18:24:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-02-02 18:24:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 18:24:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2018-02-02 18:24:40,472 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 42 [2018-02-02 18:24:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:40,472 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2018-02-02 18:24:40,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:24:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-02-02 18:24:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 18:24:40,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:40,473 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-02 18:24:40,473 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-02 18:24:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash -363955689, now seen corresponding path program 1 times [2018-02-02 18:24:40,474 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:40,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:40,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:40,474 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:40,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:40,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:40,767 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-02 18:24:40,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:24:40,768 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-02 18:24:40,773 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:40,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:24:40,793 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-02 18:24:40,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:24:40,812 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:24:40,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:24:40,813 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-02 18:24:40,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 18:24:40,834 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-02 18:24:40,835 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-02 18:24:40,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-02-02 18:24:40,865 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-02 18:24:40,867 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-02 18:24:40,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,873 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-02 18:24:40,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-02-02 18:24:40,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-02 18:24:40,919 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-02 18:24:40,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,923 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-02 18:24:40,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:24:40,926 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-02 18:24:40,926 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-02-02 18:24:40,941 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-02 18:24:40,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:24:40,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-02-02 18:24:40,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 18:24:40,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 18:24:40,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-02-02 18:24:40,959 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 24 states. [2018-02-02 18:24:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:42,129 INFO L93 Difference]: Finished difference Result 253 states and 281 transitions. [2018-02-02 18:24:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 18:24:42,129 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-02-02 18:24:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:42,131 INFO L225 Difference]: With dead ends: 253 [2018-02-02 18:24:42,131 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 18:24:42,132 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-02 18:24:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 18:24:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 147. [2018-02-02 18:24:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 18:24:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-02-02 18:24:42,135 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 44 [2018-02-02 18:24:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:42,136 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-02-02 18:24:42,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 18:24:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-02-02 18:24:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 18:24:42,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:42,137 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-02 18:24:42,137 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-02 18:24:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2022275116, now seen corresponding path program 1 times [2018-02-02 18:24:42,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:42,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:42,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:42,138 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:42,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:42,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:42,288 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-02 18:24:42,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:24:42,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:24:42,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:24:42,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:24:42,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:24:42,289 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 8 states. [2018-02-02 18:24:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:42,375 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-02-02 18:24:42,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:24:42,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-02 18:24:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:42,375 INFO L225 Difference]: With dead ends: 146 [2018-02-02 18:24:42,375 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 18:24:42,376 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-02 18:24:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 18:24:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-02 18:24:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 18:24:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-02-02 18:24:42,377 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 46 [2018-02-02 18:24:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:42,377 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-02-02 18:24:42,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:24:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-02-02 18:24:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 18:24:42,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:42,378 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-02 18:24:42,378 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-02 18:24:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1787354498, now seen corresponding path program 1 times [2018-02-02 18:24:42,378 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:42,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:42,378 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:42,378 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:42,378 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:42,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:42,440 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-02 18:24:42,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:24:42,440 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-02 18:24:42,445 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:42,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:24:42,471 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-02 18:24:42,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:24:42,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2018-02-02 18:24:42,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:24:42,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:24:42,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:24:42,490 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 13 states. [2018-02-02 18:24:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:42,646 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-02 18:24:42,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:24:42,646 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-02-02 18:24:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:42,647 INFO L225 Difference]: With dead ends: 88 [2018-02-02 18:24:42,647 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 18:24:42,647 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-02 18:24:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 18:24:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-02-02 18:24:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 18:24:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 18:24:42,649 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 47 [2018-02-02 18:24:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:42,649 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 18:24:42,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:24:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 18:24:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 18:24:42,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:42,650 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-02 18:24:42,650 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-02 18:24:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1878068012, now seen corresponding path program 2 times [2018-02-02 18:24:42,650 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:42,650 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:42,651 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:42,651 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:24:42,651 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:42,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:42,786 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-02 18:24:42,786 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:24:42,786 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-02 18:24:42,794 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:24:42,836 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:24:42,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:24:42,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:24:42,910 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-02 18:24:42,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:24:42,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-02-02 18:24:42,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 18:24:42,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 18:24:42,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-02-02 18:24:42,932 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 18 states. [2018-02-02 18:24:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:43,169 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2018-02-02 18:24:43,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 18:24:43,170 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-02-02 18:24:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:43,170 INFO L225 Difference]: With dead ends: 129 [2018-02-02 18:24:43,170 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 18:24:43,170 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-02 18:24:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 18:24:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-02-02 18:24:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 18:24:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 18:24:43,172 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 55 [2018-02-02 18:24:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:43,172 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 18:24:43,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 18:24:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 18:24:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 18:24:43,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:24:43,173 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-02 18:24:43,173 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-02 18:24:43,173 INFO L82 PathProgramCache]: Analyzing trace with hash 53164877, now seen corresponding path program 3 times [2018-02-02 18:24:43,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:24:43,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:24:43,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:43,174 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:24:43,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:24:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:24:43,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:24:43,211 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-02 18:24:43,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:24:43,211 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-02 18:24:43,216 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:24:43,233 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 18:24:43,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:24:43,235 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:24:43,321 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-02 18:24:43,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:24:43,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2018-02-02 18:24:43,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 18:24:43,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 18:24:43,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:24:43,344 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 14 states. [2018-02-02 18:24:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:24:43,445 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-02 18:24:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 18:24:43,445 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-02-02 18:24:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:24:43,445 INFO L225 Difference]: With dead ends: 88 [2018-02-02 18:24:43,445 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 18:24:43,446 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-02 18:24:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 18:24:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 18:24:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 18:24:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 18:24:43,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-02-02 18:24:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:24:43,446 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 18:24:43,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 18:24:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 18:24:43,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 18:24:43,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:24:43 BoogieIcfgContainer [2018-02-02 18:24:43,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:24:43,450 INFO L168 Benchmark]: Toolchain (without parser) took 10283.81 ms. Allocated memory was 408.4 MB in the beginning and 770.7 MB in the end (delta: 362.3 MB). Free memory was 365.3 MB in the beginning and 688.7 MB in the end (delta: -323.4 MB). Peak memory consumption was 38.9 MB. Max. memory is 5.3 GB. [2018-02-02 18:24:43,451 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:24:43,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.60 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 354.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:24:43,451 INFO L168 Benchmark]: Boogie Preprocessor took 25.02 ms. Allocated memory is still 408.4 MB. Free memory was 354.7 MB in the beginning and 353.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:24:43,452 INFO L168 Benchmark]: RCFGBuilder took 231.92 ms. Allocated memory is still 408.4 MB. Free memory was 353.3 MB in the beginning and 327.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-02-02 18:24:43,452 INFO L168 Benchmark]: TraceAbstraction took 9859.66 ms. Allocated memory was 408.4 MB in the beginning and 770.7 MB in the end (delta: 362.3 MB). Free memory was 327.3 MB in the beginning and 688.7 MB in the end (delta: -361.3 MB). Peak memory consumption was 940.6 kB. Max. memory is 5.3 GB. [2018-02-02 18:24:43,453 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.15 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.60 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 354.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.02 ms. Allocated memory is still 408.4 MB. Free memory was 354.7 MB in the beginning and 353.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 231.92 ms. Allocated memory is still 408.4 MB. Free memory was 353.3 MB in the beginning and 327.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9859.66 ms. Allocated memory was 408.4 MB in the beginning and 770.7 MB in the end (delta: 362.3 MB). Free memory was 327.3 MB in the beginning and 688.7 MB in the end (delta: -361.3 MB). Peak memory consumption was 940.6 kB. 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.8s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 6.3s 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.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 296 SyntacticMatches, 11 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 5.6s 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.5s 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-02_18-24-43-458.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-02_18-24-43-458.csv Received shutdown request...