java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:04:54,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:04:54,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:04:54,569 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:04:54,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:04:54,570 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:04:54,571 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:04:54,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:04:54,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:04:54,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:04:54,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:04:54,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:04:54,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:04:54,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:04:54,578 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:04:54,580 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:04:54,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:04:54,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:04:54,583 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:04:54,584 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:04:54,586 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:04:54,586 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:04:54,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:04:54,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:04:54,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:04:54,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:04:54,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:04:54,589 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:04:54,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:04:54,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:04:54,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:04:54,590 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:04:54,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:04:54,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:04:54,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:04:54,601 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:04:54,601 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:04:54,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:04:54,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:04:54,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:04:54,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:04:54,601 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:04:54,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:04:54,602 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:04:54,602 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:04:54,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:04:54,602 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:04:54,602 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:04:54,602 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:04:54,603 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:04:54,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:04:54,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:04:54,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:04:54,603 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:04:54,603 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:04:54,603 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:04:54,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:04:54,644 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:04:54,648 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:04:54,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:04:54,649 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:04:54,650 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-04 12:04:54,799 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:04:54,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:04:54,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:04:54,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:04:54,806 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:04:54,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:04:54" (1/1) ... [2018-02-04 12:04:54,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5208d2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54, skipping insertion in model container [2018-02-04 12:04:54,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:04:54" (1/1) ... [2018-02-04 12:04:54,823 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:04:54,853 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:04:54,958 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:04:54,971 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:04:54,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54 WrapperNode [2018-02-04 12:04:54,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:04:54,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:04:54,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:04:54,977 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:04:54,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54" (1/1) ... [2018-02-04 12:04:54,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54" (1/1) ... [2018-02-04 12:04:54,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54" (1/1) ... [2018-02-04 12:04:54,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54" (1/1) ... [2018-02-04 12:04:55,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54" (1/1) ... [2018-02-04 12:04:55,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54" (1/1) ... [2018-02-04 12:04:55,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54" (1/1) ... [2018-02-04 12:04:55,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:04:55,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:04:55,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:04:55,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:04:55,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:04:55,048 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:04:55,048 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:04:55,048 INFO L136 BoogieDeclarations]: Found implementation of procedure diff [2018-02-04 12:04:55,048 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:04:55,048 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:04:55,048 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:04:55,048 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:04:55,049 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:04:55,049 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:04:55,049 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:04:55,049 INFO L128 BoogieDeclarations]: Found specification of procedure diff [2018-02-04 12:04:55,049 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:04:55,049 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:04:55,049 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:04:55,200 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:04:55,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:04:55 BoogieIcfgContainer [2018-02-04 12:04:55,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:04:55,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:04:55,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:04:55,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:04:55,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:04:54" (1/3) ... [2018-02-04 12:04:55,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3052966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:04:55, skipping insertion in model container [2018-02-04 12:04:55,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:54" (2/3) ... [2018-02-04 12:04:55,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3052966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:04:55, skipping insertion in model container [2018-02-04 12:04:55,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:04:55" (3/3) ... [2018-02-04 12:04:55,204 INFO L107 eAbstractionObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:04:55,211 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:04:55,215 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 12:04:55,237 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:04:55,238 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:04:55,238 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:04:55,238 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:04:55,238 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:04:55,238 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:04:55,238 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:04:55,238 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:04:55,239 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:04:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-02-04 12:04:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:04:55,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:55,258 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-04 12:04:55,258 INFO L371 AbstractCegarLoop]: === Iteration 1 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash -24174499, now seen corresponding path program 1 times [2018-02-04 12:04:55,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:55,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:55,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:55,293 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:55,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:55,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:55,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:55,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:04:55,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:04:55,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:04:55,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:04:55,568 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2018-02-04 12:04:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:55,679 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 12:04:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:04:55,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 12:04:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:55,689 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:04:55,689 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 12:04:55,690 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-04 12:04:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 12:04:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 12:04:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 12:04:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-02-04 12:04:55,721 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 21 [2018-02-04 12:04:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:55,722 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-02-04 12:04:55,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:04:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-02-04 12:04:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:04:55,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:55,723 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-04 12:04:55,723 INFO L371 AbstractCegarLoop]: === Iteration 2 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash -24174498, now seen corresponding path program 1 times [2018-02-04 12:04:55,724 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:55,724 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:55,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:55,725 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:55,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:55,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:55,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:55,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:04:55,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:04:55,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:04:55,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:04:55,896 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 8 states. [2018-02-04 12:04:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:56,027 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-02-04 12:04:56,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:04:56,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 12:04:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:56,031 INFO L225 Difference]: With dead ends: 63 [2018-02-04 12:04:56,031 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 12:04:56,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:04:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 12:04:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-02-04 12:04:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:04:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-04 12:04:56,038 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 21 [2018-02-04 12:04:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:56,038 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-04 12:04:56,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:04:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-04 12:04:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:04:56,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:56,039 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-04 12:04:56,040 INFO L371 AbstractCegarLoop]: === Iteration 3 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash -749409470, now seen corresponding path program 1 times [2018-02-04 12:04:56,040 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:56,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:56,041 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,041 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:56,041 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:56,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:56,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:56,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:04:56,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:04:56,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:04:56,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:04:56,096 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-02-04 12:04:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:56,154 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-02-04 12:04:56,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:04:56,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 12:04:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:56,156 INFO L225 Difference]: With dead ends: 53 [2018-02-04 12:04:56,156 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 12:04:56,157 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-04 12:04:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 12:04:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 12:04:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:04:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-04 12:04:56,161 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-02-04 12:04:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:56,162 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-04 12:04:56,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:04:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-04 12:04:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:04:56,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:56,163 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-04 12:04:56,163 INFO L371 AbstractCegarLoop]: === Iteration 4 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash -749409469, now seen corresponding path program 1 times [2018-02-04 12:04:56,163 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:56,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:56,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,164 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:56,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:56,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:56,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:56,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:04:56,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:04:56,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:04:56,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:04:56,261 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 9 states. [2018-02-04 12:04:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:56,363 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-02-04 12:04:56,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:04:56,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-04 12:04:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:56,364 INFO L225 Difference]: With dead ends: 78 [2018-02-04 12:04:56,364 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 12:04:56,365 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-04 12:04:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 12:04:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2018-02-04 12:04:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 12:04:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2018-02-04 12:04:56,368 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 22 [2018-02-04 12:04:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:56,368 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2018-02-04 12:04:56,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:04:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2018-02-04 12:04:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:04:56,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:56,369 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:56,369 INFO L371 AbstractCegarLoop]: === Iteration 5 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:56,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1756899853, now seen corresponding path program 1 times [2018-02-04 12:04:56,369 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:56,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:56,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,370 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:56,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:56,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:56,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:56,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:04:56,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:04:56,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:04:56,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:04:56,409 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 6 states. [2018-02-04 12:04:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:56,455 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2018-02-04 12:04:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:04:56,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 12:04:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:56,458 INFO L225 Difference]: With dead ends: 62 [2018-02-04 12:04:56,459 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 12:04:56,459 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-04 12:04:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 12:04:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 12:04:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 12:04:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2018-02-04 12:04:56,462 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 23 [2018-02-04 12:04:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:56,462 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2018-02-04 12:04:56,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:04:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2018-02-04 12:04:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:04:56,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:56,463 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:56,463 INFO L371 AbstractCegarLoop]: === Iteration 6 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:56,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1756899852, now seen corresponding path program 1 times [2018-02-04 12:04:56,463 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:56,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:56,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,463 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:56,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:56,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:56,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:56,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:04:56,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:04:56,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:04:56,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:04:56,514 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand 6 states. [2018-02-04 12:04:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:56,555 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2018-02-04 12:04:56,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:04:56,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 12:04:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:56,557 INFO L225 Difference]: With dead ends: 73 [2018-02-04 12:04:56,557 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 12:04:56,558 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:04:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 12:04:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2018-02-04 12:04:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 12:04:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2018-02-04 12:04:56,563 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 23 [2018-02-04 12:04:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:56,563 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2018-02-04 12:04:56,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:04:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2018-02-04 12:04:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:04:56,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:56,564 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-04 12:04:56,564 INFO L371 AbstractCegarLoop]: === Iteration 7 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:56,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1795864658, now seen corresponding path program 1 times [2018-02-04 12:04:56,565 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:56,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:56,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,566 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:56,566 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:56,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:56,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:56,658 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:04:56,666 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:56,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:56,759 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-04 12:04:56,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:04:56,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2018-02-04 12:04:56,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:04:56,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:04:56,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:04:56,791 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 13 states. [2018-02-04 12:04:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:56,898 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2018-02-04 12:04:56,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:04:56,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 12:04:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:56,900 INFO L225 Difference]: With dead ends: 132 [2018-02-04 12:04:56,900 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 12:04:56,901 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-04 12:04:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 12:04:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2018-02-04 12:04:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 12:04:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2018-02-04 12:04:56,908 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 27 [2018-02-04 12:04:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:56,908 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2018-02-04 12:04:56,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:04:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2018-02-04 12:04:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:04:56,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:56,909 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-04 12:04:56,910 INFO L371 AbstractCegarLoop]: === Iteration 8 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1681454188, now seen corresponding path program 1 times [2018-02-04 12:04:56,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:56,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:56,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:56,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:56,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:57,014 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:57,014 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:04:57,020 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:57,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:57,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:57,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:04:57,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-04 12:04:57,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:57,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 12:04:57,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:57,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:57,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:57,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:57,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:22 [2018-02-04 12:04:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:57,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:57,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 12:04:57,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:04:57,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:04:57,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:04:57,340 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand 16 states. [2018-02-04 12:04:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:57,689 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2018-02-04 12:04:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:04:57,690 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-02-04 12:04:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:57,690 INFO L225 Difference]: With dead ends: 150 [2018-02-04 12:04:57,690 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 12:04:57,691 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-04 12:04:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 12:04:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 94. [2018-02-04 12:04:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 12:04:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-02-04 12:04:57,697 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 27 [2018-02-04 12:04:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:57,697 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-02-04 12:04:57,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:04:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-02-04 12:04:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:04:57,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:57,699 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-04 12:04:57,700 INFO L371 AbstractCegarLoop]: === Iteration 9 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash -719244418, now seen corresponding path program 1 times [2018-02-04 12:04:57,700 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:57,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:57,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:57,701 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:57,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:57,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:57,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:57,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:04:57,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:04:57,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:04:57,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:04:57,735 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 5 states. [2018-02-04 12:04:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:57,757 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-02-04 12:04:57,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:04:57,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 12:04:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:57,759 INFO L225 Difference]: With dead ends: 105 [2018-02-04 12:04:57,759 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 12:04:57,759 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-04 12:04:57,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 12:04:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-02-04 12:04:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 12:04:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-02-04 12:04:57,762 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 28 [2018-02-04 12:04:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:57,762 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-02-04 12:04:57,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:04:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-02-04 12:04:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:04:57,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:57,763 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:57,763 INFO L371 AbstractCegarLoop]: === Iteration 10 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:57,763 INFO L82 PathProgramCache]: Analyzing trace with hash 105469355, now seen corresponding path program 1 times [2018-02-04 12:04:57,763 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:57,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:57,764 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:57,764 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:57,764 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:57,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:57,779 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-04 12:04:57,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:57,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:04:57,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:04:57,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:04:57,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:04:57,780 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 4 states. [2018-02-04 12:04:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:57,790 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-02-04 12:04:57,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:04:57,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 12:04:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:57,792 INFO L225 Difference]: With dead ends: 122 [2018-02-04 12:04:57,792 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 12:04:57,792 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-04 12:04:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 12:04:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 96. [2018-02-04 12:04:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 12:04:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-04 12:04:57,796 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-02-04 12:04:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:57,797 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-04 12:04:57,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:04:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-04 12:04:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:04:57,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:57,798 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:57,798 INFO L371 AbstractCegarLoop]: === Iteration 11 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:57,798 INFO L82 PathProgramCache]: Analyzing trace with hash 162727657, now seen corresponding path program 1 times [2018-02-04 12:04:57,798 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:57,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:57,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:57,799 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:57,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:57,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:57,854 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-04 12:04:57,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:57,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:04:57,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:04:57,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:04:57,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:04:57,855 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 7 states. [2018-02-04 12:04:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:57,903 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2018-02-04 12:04:57,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:04:57,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 12:04:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:57,904 INFO L225 Difference]: With dead ends: 136 [2018-02-04 12:04:57,904 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 12:04:57,904 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-04 12:04:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 12:04:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-02-04 12:04:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 12:04:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2018-02-04 12:04:57,909 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 28 [2018-02-04 12:04:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:57,909 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2018-02-04 12:04:57,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:04:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2018-02-04 12:04:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:04:57,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:57,910 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-04 12:04:57,911 INFO L371 AbstractCegarLoop]: === Iteration 12 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:57,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1543275401, now seen corresponding path program 1 times [2018-02-04 12:04:57,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:57,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:57,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:57,912 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:57,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:57,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:58,065 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-04 12:04:58,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:58,065 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:04:58,073 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:58,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:58,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:04:58,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:58,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:58,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:58,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:58,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-04 12:04:58,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:58,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 12:04:58,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:58,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:58,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:58,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:58,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:58,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:58,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:22 [2018-02-04 12:04:58,173 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-04 12:04:58,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:58,191 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-04 12:04:58,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:52 [2018-02-04 12:04:58,320 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-04 12:04:58,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:58,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-02-04 12:04:58,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:04:58,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:04:58,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:04:58,342 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand 16 states. [2018-02-04 12:04:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:58,640 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-02-04 12:04:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:04:58,641 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-02-04 12:04:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:58,641 INFO L225 Difference]: With dead ends: 140 [2018-02-04 12:04:58,641 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 12:04:58,641 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-04 12:04:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 12:04:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 108. [2018-02-04 12:04:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 12:04:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-04 12:04:58,644 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 32 [2018-02-04 12:04:58,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:58,644 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-04 12:04:58,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:04:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-04 12:04:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:04:58,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:58,645 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-04 12:04:58,645 INFO L371 AbstractCegarLoop]: === Iteration 13 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:58,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2051078643, now seen corresponding path program 1 times [2018-02-04 12:04:58,646 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:58,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:58,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:58,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:58,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:58,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:58,806 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-04 12:04:58,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:58,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:04:58,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:04:58,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:04:58,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:04:58,807 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 10 states. [2018-02-04 12:04:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:58,991 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2018-02-04 12:04:58,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:04:58,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-04 12:04:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:58,992 INFO L225 Difference]: With dead ends: 117 [2018-02-04 12:04:58,992 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 12:04:58,992 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-04 12:04:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 12:04:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-02-04 12:04:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 12:04:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-02-04 12:04:58,994 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 39 [2018-02-04 12:04:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:58,994 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-02-04 12:04:58,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:04:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-02-04 12:04:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 12:04:58,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:58,995 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-04 12:04:58,995 INFO L371 AbstractCegarLoop]: === Iteration 14 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:04:58,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1625144734, now seen corresponding path program 1 times [2018-02-04 12:04:58,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:58,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:58,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:58,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:58,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:59,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:59,170 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-04 12:04:59,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:59,171 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:04:59,181 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:59,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:59,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:04:59,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:59,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:59,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 12:04:59,378 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-04 12:04:59,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:59,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2018-02-04 12:04:59,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 12:04:59,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 12:04:59,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-04 12:04:59,395 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 20 states. [2018-02-04 12:04:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:59,739 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2018-02-04 12:04:59,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:04:59,774 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-02-04 12:04:59,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:59,774 INFO L225 Difference]: With dead ends: 138 [2018-02-04 12:04:59,775 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:04:59,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:04:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:04:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:04:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:04:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:04:59,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-02-04 12:04:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:59,776 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:04:59,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 12:04:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:04:59,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:04:59,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:04:59 BoogieIcfgContainer [2018-02-04 12:04:59,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:04:59,781 INFO L168 Benchmark]: Toolchain (without parser) took 4981.20 ms. Allocated memory was 402.7 MB in the beginning and 718.3 MB in the end (delta: 315.6 MB). Free memory was 360.7 MB in the beginning and 642.3 MB in the end (delta: -281.7 MB). Peak memory consumption was 34.0 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:59,782 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:04:59,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.72 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:59,783 INFO L168 Benchmark]: Boogie Preprocessor took 30.05 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:59,783 INFO L168 Benchmark]: RCFGBuilder took 192.98 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 326.3 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:59,783 INFO L168 Benchmark]: TraceAbstraction took 4579.94 ms. Allocated memory was 402.7 MB in the beginning and 718.3 MB in the end (delta: 315.6 MB). Free memory was 326.3 MB in the beginning and 642.3 MB in the end (delta: -316.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:04:59,784 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 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 175.72 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.05 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 192.98 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 326.3 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4579.94 ms. Allocated memory was 402.7 MB in the beginning and 718.3 MB in the end (delta: 315.6 MB). Free memory was 326.3 MB in the beginning and 642.3 MB in the end (delta: -316.1 MB). There was no memory consumed. 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.5s 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.8s 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, 1.9s 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-04_12-04-59-790.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-04_12-04-59-790.csv Received shutdown request...