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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:43:26,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:43:26,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:43:26,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:43:26,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:43:26,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:43:26,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:43:26,670 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:43:26,672 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:43:26,672 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:43:26,673 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:43:26,673 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:43:26,674 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:43:26,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:43:26,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:43:26,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:43:26,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:43:26,681 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:43:26,682 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:43:26,683 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:43:26,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:43:26,685 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:43:26,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:43:26,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:43:26,687 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:43:26,688 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:43:26,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:43:26,688 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:43:26,688 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:43:26,689 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:43:26,689 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:43:26,689 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:43:26,699 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:43:26,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:43:26,701 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:43:26,701 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:43:26,701 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:43:26,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:43:26,701 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:43:26,702 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:43:26,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:43:26,702 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:43:26,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:43:26,702 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:43:26,702 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:43:26,702 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:43:26,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:43:26,703 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:43:26,703 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:43:26,703 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:43:26,703 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:43:26,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:43:26,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:43:26,704 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:43:26,704 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:43:26,704 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:43:26,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:43:26,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:43:26,745 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:43:26,748 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:43:26,750 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:43:26,750 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:43:26,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:43:26,910 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:43:26,912 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:43:26,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:43:26,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:43:26,918 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:43:26,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:43:26" (1/1) ... [2018-02-02 08:43:26,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1bdbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:26, skipping insertion in model container [2018-02-02 08:43:26,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:43:26" (1/1) ... [2018-02-02 08:43:26,937 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:43:26,971 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:43:27,057 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:43:27,069 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:43:27,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:27 WrapperNode [2018-02-02 08:43:27,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:43:27,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:43:27,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:43:27,075 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:43:27,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:27" (1/1) ... [2018-02-02 08:43:27,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:27" (1/1) ... [2018-02-02 08:43:27,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:27" (1/1) ... [2018-02-02 08:43:27,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:27" (1/1) ... [2018-02-02 08:43:27,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:27" (1/1) ... [2018-02-02 08:43:27,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:27" (1/1) ... [2018-02-02 08:43:27,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:27" (1/1) ... [2018-02-02 08:43:27,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:43:27,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:43:27,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:43:27,104 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:43:27,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:27" (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 08:43:27,141 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:43:27,141 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:43:27,141 INFO L136 BoogieDeclarations]: Found implementation of procedure diff [2018-02-02 08:43:27,142 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:43:27,142 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:43:27,142 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:43:27,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:43:27,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:43:27,142 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:43:27,142 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:43:27,143 INFO L128 BoogieDeclarations]: Found specification of procedure diff [2018-02-02 08:43:27,143 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:43:27,143 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:43:27,143 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:43:27,295 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:43:27,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:43:27 BoogieIcfgContainer [2018-02-02 08:43:27,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:43:27,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:43:27,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:43:27,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:43:27,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:43:26" (1/3) ... [2018-02-02 08:43:27,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498cb095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:43:27, skipping insertion in model container [2018-02-02 08:43:27,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:27" (2/3) ... [2018-02-02 08:43:27,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498cb095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:43:27, skipping insertion in model container [2018-02-02 08:43:27,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:43:27" (3/3) ... [2018-02-02 08:43:27,300 INFO L107 eAbstractionObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:43:27,306 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:43:27,311 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 08:43:27,340 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:43:27,340 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:43:27,340 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:43:27,340 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:43:27,340 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:43:27,340 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:43:27,340 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:43:27,341 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:43:27,341 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:43:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-02-02 08:43:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 08:43:27,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:27,361 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:27,361 INFO L371 AbstractCegarLoop]: === Iteration 1 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:27,364 INFO L82 PathProgramCache]: Analyzing trace with hash -24174499, now seen corresponding path program 1 times [2018-02-02 08:43:27,366 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:27,366 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:27,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:27,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:27,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:27,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:27,612 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 08:43:27,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:27,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:43:27,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:43:27,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:43:27,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:43:27,630 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2018-02-02 08:43:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:27,820 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-02 08:43:27,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:43:27,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-02 08:43:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:27,830 INFO L225 Difference]: With dead ends: 48 [2018-02-02 08:43:27,830 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 08:43:27,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:43:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 08:43:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 08:43:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 08:43:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-02-02 08:43:27,856 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 21 [2018-02-02 08:43:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:27,856 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-02-02 08:43:27,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:43:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-02-02 08:43:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 08:43:27,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:27,857 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] [2018-02-02 08:43:27,857 INFO L371 AbstractCegarLoop]: === Iteration 2 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:27,857 INFO L82 PathProgramCache]: Analyzing trace with hash -24174498, now seen corresponding path program 1 times [2018-02-02 08:43:27,857 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:27,858 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:27,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:27,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:27,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:27,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:28,002 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 08:43:28,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:28,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:43:28,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:43:28,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:43:28,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:43:28,005 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 8 states. [2018-02-02 08:43:28,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:28,144 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-02-02 08:43:28,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:43:28,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 08:43:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:28,150 INFO L225 Difference]: With dead ends: 63 [2018-02-02 08:43:28,150 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 08:43:28,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:43:28,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 08:43:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-02-02 08:43:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 08:43:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-02 08:43:28,157 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 21 [2018-02-02 08:43:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:28,157 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-02 08:43:28,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:43:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-02 08:43:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:43:28,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:28,158 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] [2018-02-02 08:43:28,158 INFO L371 AbstractCegarLoop]: === Iteration 3 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash -749409470, now seen corresponding path program 1 times [2018-02-02 08:43:28,158 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:28,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:28,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:28,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:28,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:28,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:28,215 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 08:43:28,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:28,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:43:28,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:43:28,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:43:28,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:43:28,216 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-02-02 08:43:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:28,260 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-02-02 08:43:28,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:43:28,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 08:43:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:28,261 INFO L225 Difference]: With dead ends: 53 [2018-02-02 08:43:28,261 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 08:43:28,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:43:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 08:43:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 08:43:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 08:43:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-02 08:43:28,264 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-02-02 08:43:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:28,265 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-02 08:43:28,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:43:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-02 08:43:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:43:28,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:28,266 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] [2018-02-02 08:43:28,266 INFO L371 AbstractCegarLoop]: === Iteration 4 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:28,266 INFO L82 PathProgramCache]: Analyzing trace with hash -749409469, now seen corresponding path program 1 times [2018-02-02 08:43:28,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:28,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:28,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:28,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:28,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:28,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:28,362 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 08:43:28,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:28,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:43:28,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:43:28,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:43:28,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:43:28,363 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 9 states. [2018-02-02 08:43:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:28,456 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-02-02 08:43:28,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:43:28,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 08:43:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:28,460 INFO L225 Difference]: With dead ends: 78 [2018-02-02 08:43:28,460 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 08:43:28,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:43:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 08:43:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2018-02-02 08:43:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 08:43:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2018-02-02 08:43:28,463 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 22 [2018-02-02 08:43:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:28,464 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2018-02-02 08:43:28,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:43:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2018-02-02 08:43:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:43:28,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:28,464 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 08:43:28,464 INFO L371 AbstractCegarLoop]: === Iteration 5 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:28,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1756899853, now seen corresponding path program 1 times [2018-02-02 08:43:28,464 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:28,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:28,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:28,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:28,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:28,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:28,514 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 08:43:28,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:28,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:43:28,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:43:28,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:43:28,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:43:28,515 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 6 states. [2018-02-02 08:43:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:28,566 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2018-02-02 08:43:28,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:43:28,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 08:43:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:28,571 INFO L225 Difference]: With dead ends: 62 [2018-02-02 08:43:28,571 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 08:43:28,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:43:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 08:43:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-02 08:43:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 08:43:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2018-02-02 08:43:28,575 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 23 [2018-02-02 08:43:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:28,575 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2018-02-02 08:43:28,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:43:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2018-02-02 08:43:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:43:28,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:28,576 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 08:43:28,576 INFO L371 AbstractCegarLoop]: === Iteration 6 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:28,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1756899852, now seen corresponding path program 1 times [2018-02-02 08:43:28,577 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:28,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:28,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:28,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:28,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:28,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:28,626 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 08:43:28,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:28,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:43:28,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:43:28,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:43:28,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:43:28,628 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand 6 states. [2018-02-02 08:43:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:28,680 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2018-02-02 08:43:28,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:43:28,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 08:43:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:28,681 INFO L225 Difference]: With dead ends: 73 [2018-02-02 08:43:28,681 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 08:43:28,682 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 08:43:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 08:43:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2018-02-02 08:43:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 08:43:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2018-02-02 08:43:28,687 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 23 [2018-02-02 08:43:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:28,687 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2018-02-02 08:43:28,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:43:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2018-02-02 08:43:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 08:43:28,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:28,688 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:28,688 INFO L371 AbstractCegarLoop]: === Iteration 7 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1795864658, now seen corresponding path program 1 times [2018-02-02 08:43:28,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:28,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:28,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:28,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:28,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:28,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:28,781 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 08:43:28,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:43:28,781 INFO L209 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 08:43:28,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:28,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:43:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:28,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:43:28,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2018-02-02 08:43:28,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:43:28,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:43:28,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:43:28,915 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 13 states. [2018-02-02 08:43:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:29,011 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2018-02-02 08:43:29,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:43:29,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 08:43:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:29,012 INFO L225 Difference]: With dead ends: 132 [2018-02-02 08:43:29,012 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 08:43:29,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:43:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 08:43:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2018-02-02 08:43:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 08:43:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2018-02-02 08:43:29,020 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 27 [2018-02-02 08:43:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:29,021 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2018-02-02 08:43:29,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:43:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2018-02-02 08:43:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 08:43:29,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:29,022 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:29,023 INFO L371 AbstractCegarLoop]: === Iteration 8 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:29,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1681454188, now seen corresponding path program 1 times [2018-02-02 08:43:29,023 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:29,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:29,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:29,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:29,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:29,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:29,159 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 08:43:29,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:43:29,159 INFO L209 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 08:43:29,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:29,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:43:29,233 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 08:43:29,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:29,243 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 08:43:29,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:29,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:29,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-02 08:43:29,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:29,287 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 08:43:29,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:29,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:29,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:29,301 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 08:43:29,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:29,309 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 08:43:29,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:22 [2018-02-02 08:43:29,471 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 08:43:29,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:43:29,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-02 08:43:29,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 08:43:29,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 08:43:29,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:43:29,488 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand 16 states. [2018-02-02 08:43:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:29,844 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2018-02-02 08:43:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:43:29,844 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-02-02 08:43:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:29,845 INFO L225 Difference]: With dead ends: 150 [2018-02-02 08:43:29,845 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 08:43:29,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:43:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 08:43:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 94. [2018-02-02 08:43:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 08:43:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-02-02 08:43:29,849 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 27 [2018-02-02 08:43:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:29,849 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-02-02 08:43:29,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 08:43:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-02-02 08:43:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:43:29,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:29,850 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:29,853 INFO L371 AbstractCegarLoop]: === Iteration 9 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash -719244418, now seen corresponding path program 1 times [2018-02-02 08:43:29,853 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:29,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:29,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:29,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:29,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:29,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:29,887 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 08:43:29,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:29,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:43:29,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:43:29,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:43:29,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:43:29,888 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 5 states. [2018-02-02 08:43:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:29,917 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-02-02 08:43:29,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:43:29,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 08:43:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:29,918 INFO L225 Difference]: With dead ends: 105 [2018-02-02 08:43:29,918 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 08:43:29,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:43:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 08:43:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-02-02 08:43:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 08:43:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-02-02 08:43:29,929 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 28 [2018-02-02 08:43:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:29,930 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-02-02 08:43:29,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:43:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-02-02 08:43:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:43:29,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:29,930 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 08:43:29,931 INFO L371 AbstractCegarLoop]: === Iteration 10 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:29,931 INFO L82 PathProgramCache]: Analyzing trace with hash 105469355, now seen corresponding path program 1 times [2018-02-02 08:43:29,931 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:29,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:29,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:29,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:29,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:29,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:29,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:29,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:43:29,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:43:29,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:43:29,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:43:29,979 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 4 states. [2018-02-02 08:43:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:29,993 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-02-02 08:43:29,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:43:29,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-02 08:43:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:29,994 INFO L225 Difference]: With dead ends: 122 [2018-02-02 08:43:29,995 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 08:43:29,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:43:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 08:43:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 96. [2018-02-02 08:43:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 08:43:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-02 08:43:30,000 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-02-02 08:43:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:30,000 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-02 08:43:30,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:43:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-02 08:43:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:43:30,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:30,001 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 08:43:30,001 INFO L371 AbstractCegarLoop]: === Iteration 11 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:30,001 INFO L82 PathProgramCache]: Analyzing trace with hash 162727657, now seen corresponding path program 1 times [2018-02-02 08:43:30,002 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:30,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:30,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:30,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:30,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:30,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 08:43:30,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:30,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:43:30,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:43:30,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:43:30,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:43:30,070 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 7 states. [2018-02-02 08:43:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:30,117 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2018-02-02 08:43:30,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:43:30,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-02 08:43:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:30,119 INFO L225 Difference]: With dead ends: 136 [2018-02-02 08:43:30,119 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 08:43:30,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:43:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 08:43:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-02-02 08:43:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 08:43:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2018-02-02 08:43:30,125 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 28 [2018-02-02 08:43:30,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:30,125 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2018-02-02 08:43:30,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:43:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2018-02-02 08:43:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 08:43:30,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:30,126 INFO L351 BasicCegarLoop]: trace histogram [3, 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 08:43:30,126 INFO L371 AbstractCegarLoop]: === Iteration 12 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1543275401, now seen corresponding path program 1 times [2018-02-02 08:43:30,127 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:30,127 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:30,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:30,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:30,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:30,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:30,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:43:30,272 INFO L209 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 08:43:30,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:30,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:43:30,304 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 08:43:30,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:30,310 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 08:43:30,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:30,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:30,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-02 08:43:30,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:30,330 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 08:43:30,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:30,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:30,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:30,344 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 08:43:30,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:30,351 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 08:43:30,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:22 [2018-02-02 08:43:30,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2018-02-02 08:43:30,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-02 08:43:30,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 08:43:30,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:52 [2018-02-02 08:43:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 08:43:30,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:43:30,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-02-02 08:43:30,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 08:43:30,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 08:43:30,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:43:30,591 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand 16 states. [2018-02-02 08:43:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:30,862 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-02-02 08:43:30,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:43:30,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-02-02 08:43:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:30,863 INFO L225 Difference]: With dead ends: 140 [2018-02-02 08:43:30,863 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 08:43:30,863 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:43:30,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 08:43:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 108. [2018-02-02 08:43:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 08:43:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-02 08:43:30,867 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 32 [2018-02-02 08:43:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:30,868 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-02 08:43:30,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 08:43:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-02 08:43:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 08:43:30,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:30,869 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] [2018-02-02 08:43:30,869 INFO L371 AbstractCegarLoop]: === Iteration 13 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:30,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2051078643, now seen corresponding path program 1 times [2018-02-02 08:43:30,869 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:30,869 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:30,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:30,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:30,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:30,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 08:43:31,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:31,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 08:43:31,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:43:31,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:43:31,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:43:31,052 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 10 states. [2018-02-02 08:43:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:31,206 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2018-02-02 08:43:31,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:43:31,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-02 08:43:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:31,207 INFO L225 Difference]: With dead ends: 117 [2018-02-02 08:43:31,207 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 08:43:31,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:43:31,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 08:43:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-02-02 08:43:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 08:43:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-02-02 08:43:31,211 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 39 [2018-02-02 08:43:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:31,211 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-02-02 08:43:31,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:43:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-02-02 08:43:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 08:43:31,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:31,213 INFO L351 BasicCegarLoop]: trace histogram [4, 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 08:43:31,213 INFO L371 AbstractCegarLoop]: === Iteration 14 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 08:43:31,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1625144734, now seen corresponding path program 1 times [2018-02-02 08:43:31,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:31,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:31,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:31,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:31,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:31,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 08:43:31,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:43:31,437 INFO L209 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 08:43:31,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:31,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:43:31,491 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 08:43:31,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:31,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:31,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-02 08:43:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 08:43:31,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:43:31,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2018-02-02 08:43:31,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 08:43:31,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 08:43:31,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-02 08:43:31,721 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 20 states. [2018-02-02 08:43:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:32,065 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2018-02-02 08:43:32,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:43:32,065 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-02-02 08:43:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:32,065 INFO L225 Difference]: With dead ends: 138 [2018-02-02 08:43:32,065 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 08:43:32,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2018-02-02 08:43:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 08:43:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 08:43:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 08:43:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 08:43:32,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-02-02 08:43:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:32,067 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 08:43:32,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 08:43:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 08:43:32,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 08:43:32,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:43:32 BoogieIcfgContainer [2018-02-02 08:43:32,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:43:32,072 INFO L168 Benchmark]: Toolchain (without parser) took 5160.94 ms. Allocated memory was 403.2 MB in the beginning and 715.7 MB in the end (delta: 312.5 MB). Free memory was 357.2 MB in the beginning and 628.0 MB in the end (delta: -270.8 MB). Peak memory consumption was 41.7 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:32,073 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 403.2 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:43:32,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.29 ms. Allocated memory is still 403.2 MB. Free memory was 357.2 MB in the beginning and 346.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 08:43:32,073 INFO L168 Benchmark]: Boogie Preprocessor took 28.92 ms. Allocated memory is still 403.2 MB. Free memory was 346.7 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:32,073 INFO L168 Benchmark]: RCFGBuilder took 191.47 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 324.2 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:32,073 INFO L168 Benchmark]: TraceAbstraction took 4775.23 ms. Allocated memory was 403.2 MB in the beginning and 715.7 MB in the end (delta: 312.5 MB). Free memory was 324.2 MB in the beginning and 628.0 MB in the end (delta: -303.8 MB). Peak memory consumption was 8.7 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:32,074 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 403.2 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.29 ms. Allocated memory is still 403.2 MB. Free memory was 357.2 MB in the beginning and 346.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 28.92 ms. Allocated memory is still 403.2 MB. Free memory was 346.7 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 191.47 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 324.2 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4775.23 ms. Allocated memory was 403.2 MB in the beginning and 715.7 MB in the end (delta: 312.5 MB). Free memory was 324.2 MB in the beginning and 628.0 MB in the end (delta: -303.8 MB). Peak memory consumption was 8.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 9 error locations. SAFE Result, 4.7s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 559 SDtfs, 1093 SDslu, 2048 SDs, 0 SdLazy, 1528 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 125 SyntacticMatches, 7 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=11, 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, 14 MinimizatonAttempts, 197 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 493 ConstructedInterpolants, 62 QuantifiedInterpolants, 138044 SizeOfPredicates, 31 NumberOfNonLiveVariables, 653 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 30/82 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/diff-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-43-32-081.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-43-32-081.csv Received shutdown request...