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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:23:25,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:23:25,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:23:25,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:23:25,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:23:25,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:23:25,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:23:25,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:23:25,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:23:25,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:23:25,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:23:25,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:23:25,479 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:23:25,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:23:25,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:23:25,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:23:25,486 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:23:25,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:23:25,489 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:23:25,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:23:25,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:23:25,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:23:25,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:23:25,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:23:25,495 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:23:25,496 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:23:25,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:23:25,497 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:23:25,497 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:23:25,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:23:25,498 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:23:25,498 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:23:25,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:23:25,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:23:25,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:23:25,507 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:23:25,507 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:23:25,507 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:23:25,508 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:23:25,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:23:25,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:23:25,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:23:25,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:23:25,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:23:25,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:23:25,509 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:23:25,509 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:23:25,509 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:23:25,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:23:25,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:23:25,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:23:25,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:23:25,510 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:23:25,510 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:23:25,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:23:25,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:23:25,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:23:25,511 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:23:25,511 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:23:25,511 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:23:25,511 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:23:25,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:23:25,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:23:25,512 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:23:25,512 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:23:25,512 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:23:25,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:23:25,554 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:23:25,557 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:23:25,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:23:25,558 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:23:25,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-24 12:23:25,742 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:23:25,748 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:23:25,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:23:25,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:23:25,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:23:25,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:23:25" (1/1) ... [2018-01-24 12:23:25,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2871eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25, skipping insertion in model container [2018-01-24 12:23:25,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:23:25" (1/1) ... [2018-01-24 12:23:25,771 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:23:25,820 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:23:25,934 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:23:25,949 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:23:25,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25 WrapperNode [2018-01-24 12:23:25,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:23:25,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:23:25,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:23:25,957 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:23:25,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25" (1/1) ... [2018-01-24 12:23:25,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25" (1/1) ... [2018-01-24 12:23:25,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25" (1/1) ... [2018-01-24 12:23:25,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25" (1/1) ... [2018-01-24 12:23:25,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25" (1/1) ... [2018-01-24 12:23:25,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25" (1/1) ... [2018-01-24 12:23:25,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25" (1/1) ... [2018-01-24 12:23:25,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:23:25,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:23:25,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:23:25,998 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:23:25,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25" (1/1) ... No working directory specified, using /storage/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-01-24 12:23:26,053 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:23:26,053 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:23:26,053 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:23:26,053 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:23:26,053 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:23:26,053 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:23:26,053 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:23:26,053 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:23:26,053 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:23:26,054 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:23:26,054 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:23:26,054 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:23:26,054 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:23:26,054 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:23:26,054 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:23:26,054 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:23:26,054 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:23:26,054 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:23:26,243 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:23:26,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:23:26 BoogieIcfgContainer [2018-01-24 12:23:26,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:23:26,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:23:26,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:23:26,247 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:23:26,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:23:25" (1/3) ... [2018-01-24 12:23:26,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f95daad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:23:26, skipping insertion in model container [2018-01-24 12:23:26,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:25" (2/3) ... [2018-01-24 12:23:26,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f95daad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:23:26, skipping insertion in model container [2018-01-24 12:23:26,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:23:26" (3/3) ... [2018-01-24 12:23:26,251 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-24 12:23:26,259 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:23:26,267 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 12:23:26,315 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:23:26,315 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:23:26,315 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:23:26,316 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:23:26,316 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:23:26,316 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:23:26,316 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:23:26,316 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:23:26,317 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:23:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 12:23:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:23:26,340 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:26,341 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:26,341 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-01-24 12:23:26,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:26,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:26,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:26,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:26,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:26,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:26,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:23:26,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:23:26,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:23:26,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:23:26,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:23:26,558 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 12:23:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:26,739 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2018-01-24 12:23:26,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:23:26,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 12:23:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:26,750 INFO L225 Difference]: With dead ends: 84 [2018-01-24 12:23:26,751 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 12:23:26,754 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:23:26,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 12:23:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-01-24 12:23:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 12:23:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-01-24 12:23:26,797 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-01-24 12:23:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:26,798 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-01-24 12:23:26,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:23:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-01-24 12:23:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:23:26,800 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:26,800 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:26,800 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:26,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-01-24 12:23:26,801 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:26,801 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:26,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:26,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:26,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:26,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:26,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:23:26,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:23:26,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:23:26,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:23:26,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:23:26,887 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-01-24 12:23:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:26,972 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-01-24 12:23:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:23:26,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:23:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:26,974 INFO L225 Difference]: With dead ends: 82 [2018-01-24 12:23:26,974 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 12:23:26,975 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:23:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 12:23:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-01-24 12:23:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 12:23:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-24 12:23:26,985 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-01-24 12:23:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:26,985 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-24 12:23:26,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:23:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-24 12:23:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:23:26,987 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:26,987 INFO L322 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-01-24 12:23:26,987 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-01-24 12:23:26,987 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:26,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:26,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:26,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:26,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:27,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:27,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:23:27,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:23:27,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:23:27,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:23:27,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:23:27,049 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-01-24 12:23:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:27,079 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-01-24 12:23:27,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:23:27,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-24 12:23:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:27,080 INFO L225 Difference]: With dead ends: 90 [2018-01-24 12:23:27,080 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 12:23:27,081 INFO L525 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-01-24 12:23:27,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 12:23:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-01-24 12:23:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 12:23:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-01-24 12:23:27,088 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-01-24 12:23:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:27,088 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-01-24 12:23:27,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:23:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-01-24 12:23:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:23:27,090 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:27,090 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:27,090 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:27,090 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-01-24 12:23:27,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:27,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:27,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:27,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:27,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:27,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:23:27,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:27,160 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:27,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:27,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:27,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:23:27,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-24 12:23:27,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:23:27,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:23:27,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:23:27,263 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-01-24 12:23:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:27,283 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-01-24 12:23:27,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:23:27,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 12:23:27,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:27,284 INFO L225 Difference]: With dead ends: 91 [2018-01-24 12:23:27,284 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 12:23:27,284 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:23:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 12:23:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 12:23:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 12:23:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-24 12:23:27,289 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-01-24 12:23:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:27,289 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-24 12:23:27,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:23:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-24 12:23:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:23:27,290 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:27,290 INFO L322 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] [2018-01-24 12:23:27,290 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:27,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-01-24 12:23:27,291 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:27,291 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:27,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:27,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:27,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:27,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:23:27,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:23:27,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:23:27,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:23:27,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:23:27,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:23:27,352 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-01-24 12:23:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:27,376 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-24 12:23:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:23:27,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 12:23:27,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:27,377 INFO L225 Difference]: With dead ends: 86 [2018-01-24 12:23:27,377 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 12:23:27,378 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:23:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 12:23:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-01-24 12:23:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:23:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 12:23:27,383 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-01-24 12:23:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:27,383 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 12:23:27,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:23:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 12:23:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:23:27,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:27,384 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:27,385 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-01-24 12:23:27,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:27,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:27,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:27,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:27,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:27,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:27,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:27,559 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:27,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:27,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:27,618 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-01-24 12:23:27,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:27,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:23:27,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:23:27,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:27,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:27,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:23:27,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:27,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:23:27,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 12:23:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:27,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:27,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-24 12:23:27,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:23:27,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:23:27,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:23:27,800 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 11 states. [2018-01-24 12:23:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:28,259 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-01-24 12:23:28,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:23:28,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-01-24 12:23:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:28,261 INFO L225 Difference]: With dead ends: 75 [2018-01-24 12:23:28,261 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 12:23:28,261 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:23:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 12:23:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-01-24 12:23:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 12:23:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-01-24 12:23:28,270 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 28 [2018-01-24 12:23:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:28,270 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-01-24 12:23:28,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:23:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-01-24 12:23:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:23:28,271 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:28,271 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:28,272 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:23:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-01-24 12:23:28,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:28,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:28,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:28,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:28,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:28,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:28,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:28,686 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:28,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:28,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:28,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 12:23:28,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:28,821 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 23 treesize of output 22 [2018-01-24 12:23:28,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:28,823 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 25 treesize of output 24 [2018-01-24 12:23:28,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:28,838 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 22 treesize of output 21 [2018-01-24 12:23:28,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:28,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:23:28,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 12:23:29,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:29,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:29,088 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 54 treesize of output 48 [2018-01-24 12:23:29,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:29,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:29,134 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 45 treesize of output 48 [2018-01-24 12:23:29,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:29,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:29,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:29,180 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 44 treesize of output 38 [2018-01-24 12:23:29,181 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:29,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:29,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-24 12:23:29,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:29,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 12:23:29,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 12:23:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:29,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:29,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-01-24 12:23:29,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:23:29,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:23:29,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=295, Unknown=1, NotChecked=0, Total=342 [2018-01-24 12:23:29,664 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 19 states. [2018-01-24 12:23:29,974 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-24 12:24:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:12,034 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2018-01-24 12:24:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:24:12,034 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-01-24 12:24:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:12,036 INFO L225 Difference]: With dead ends: 105 [2018-01-24 12:24:12,036 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 12:24:12,036 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=122, Invalid=686, Unknown=4, NotChecked=0, Total=812 [2018-01-24 12:24:12,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 12:24:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 70. [2018-01-24 12:24:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 12:24:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-01-24 12:24:12,052 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 28 [2018-01-24 12:24:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:12,052 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-01-24 12:24:12,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:24:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-01-24 12:24:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:24:12,053 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:12,054 INFO L322 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] [2018-01-24 12:24:12,054 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1097237542, now seen corresponding path program 1 times [2018-01-24 12:24:12,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:12,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:12,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:12,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:12,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:12,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:24:12,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:12,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:24:12,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:24:12,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:24:12,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:24:12,106 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2018-01-24 12:24:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:12,132 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-01-24 12:24:12,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:24:12,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 12:24:12,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:12,133 INFO L225 Difference]: With dead ends: 84 [2018-01-24 12:24:12,134 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 12:24:12,134 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:24:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 12:24:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-01-24 12:24:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 12:24:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-01-24 12:24:12,148 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 29 [2018-01-24 12:24:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:12,148 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-01-24 12:24:12,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:24:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-01-24 12:24:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:24:12,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:12,150 INFO L322 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] [2018-01-24 12:24:12,150 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:12,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1190998490, now seen corresponding path program 1 times [2018-01-24 12:24:12,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:12,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:12,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:12,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:12,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:12,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:24:12,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:12,294 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:24:12,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:12,322 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:24:12,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:12,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-24 12:24:12,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:24:12,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:24:12,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-24 12:24:12,449 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 13 states. [2018-01-24 12:24:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:12,730 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-24 12:24:12,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:24:12,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-01-24 12:24:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:12,731 INFO L225 Difference]: With dead ends: 70 [2018-01-24 12:24:12,731 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:24:12,731 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=247, Unknown=9, NotChecked=0, Total=306 [2018-01-24 12:24:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:24:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 12:24:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:24:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-01-24 12:24:12,742 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2018-01-24 12:24:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:12,743 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-01-24 12:24:12,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:24:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-01-24 12:24:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:24:12,744 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:12,744 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:12,744 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:12,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1833910404, now seen corresponding path program 1 times [2018-01-24 12:24:12,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:12,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:12,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:12,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:12,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:12,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:24:12,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:12,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:24:12,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:24:12,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:24:12,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:24:12,791 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-01-24 12:24:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:12,829 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-01-24 12:24:12,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:24:12,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-24 12:24:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:12,830 INFO L225 Difference]: With dead ends: 84 [2018-01-24 12:24:12,830 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 12:24:12,831 INFO L525 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-01-24 12:24:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 12:24:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-01-24 12:24:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 12:24:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-24 12:24:12,840 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 34 [2018-01-24 12:24:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:12,840 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-24 12:24:12,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:24:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-24 12:24:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:24:12,841 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:12,841 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:12,841 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:12,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1409435322, now seen corresponding path program 1 times [2018-01-24 12:24:12,842 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:12,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:12,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:12,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:12,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:12,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:24:12,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:12,888 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:12,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:12,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:24:12,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:12,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-01-24 12:24:12,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:24:12,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:24:12,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:24:12,993 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 7 states. [2018-01-24 12:24:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:13,114 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-01-24 12:24:13,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:24:13,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-24 12:24:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:13,116 INFO L225 Difference]: With dead ends: 91 [2018-01-24 12:24:13,116 INFO L226 Difference]: Without dead ends: 87 [2018-01-24 12:24:13,116 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:24:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-24 12:24:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2018-01-24 12:24:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 12:24:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-01-24 12:24:13,127 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 34 [2018-01-24 12:24:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:13,127 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-01-24 12:24:13,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:24:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-01-24 12:24:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:24:13,128 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:13,128 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:13,129 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash 804244387, now seen corresponding path program 1 times [2018-01-24 12:24:13,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:13,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:13,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:13,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:13,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:13,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:24:13,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:13,487 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:13,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:13,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:13,554 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 23 treesize of output 22 [2018-01-24 12:24:13,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:13,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 12:24:13,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:13,599 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 25 treesize of output 24 [2018-01-24 12:24:13,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:13,602 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 22 treesize of output 21 [2018-01-24 12:24:13,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:13,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:24:13,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 12:24:13,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:13,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:13,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 25 [2018-01-24 12:24:13,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:13,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:13,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:13,895 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-01-24 12:24:13,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:13,910 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-01-24 12:24:13,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-01-24 12:24:14,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:14,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:14,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:14,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 34 [2018-01-24 12:24:14,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:14,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:14,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:14,151 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-01-24 12:24:14,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:14,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 12:24:14,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-01-24 12:24:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:24:14,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:14,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-01-24 12:24:14,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 12:24:14,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 12:24:14,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=528, Unknown=1, NotChecked=0, Total=600 [2018-01-24 12:24:14,251 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 25 states. [2018-01-24 12:24:14,545 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 64 DAG size of output 59 [2018-01-24 12:24:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:15,087 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-01-24 12:24:15,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:24:15,087 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2018-01-24 12:24:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:15,088 INFO L225 Difference]: With dead ends: 88 [2018-01-24 12:24:15,088 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 12:24:15,089 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=982, Unknown=3, NotChecked=0, Total=1122 [2018-01-24 12:24:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 12:24:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-01-24 12:24:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 12:24:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2018-01-24 12:24:15,099 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 41 [2018-01-24 12:24:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:15,099 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2018-01-24 12:24:15,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 12:24:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2018-01-24 12:24:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:24:15,100 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:15,100 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:15,100 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash 835021389, now seen corresponding path program 1 times [2018-01-24 12:24:15,101 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:15,101 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:15,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:15,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:15,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:15,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:24:15,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:15,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:24:15,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:24:15,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:24:15,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:24:15,190 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 6 states. [2018-01-24 12:24:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:15,311 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2018-01-24 12:24:15,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:24:15,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-24 12:24:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:15,313 INFO L225 Difference]: With dead ends: 81 [2018-01-24 12:24:15,313 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 12:24:15,313 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:24:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 12:24:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-01-24 12:24:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 12:24:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-01-24 12:24:15,327 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 42 [2018-01-24 12:24:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:15,328 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-01-24 12:24:15,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:24:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-01-24 12:24:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:24:15,329 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:15,329 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:15,329 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash 115859282, now seen corresponding path program 1 times [2018-01-24 12:24:15,330 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:15,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:15,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:15,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:15,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:15,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 12:24:15,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:15,582 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:15,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:15,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:15,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:24:15,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:24:15,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:15,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:15,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:15,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-24 12:24:15,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-24 12:24:15,864 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:24:15,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:24:15,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:15,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:15,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:15,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-01-24 12:24:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:24:15,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:15,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-01-24 12:24:15,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:24:15,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:24:15,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:24:15,901 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 20 states. [2018-01-24 12:24:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:16,173 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-01-24 12:24:16,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:24:16,174 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-01-24 12:24:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:16,175 INFO L225 Difference]: With dead ends: 94 [2018-01-24 12:24:16,175 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 12:24:16,175 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:24:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 12:24:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-01-24 12:24:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 12:24:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-01-24 12:24:16,184 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 43 [2018-01-24 12:24:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:16,184 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-01-24 12:24:16,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:24:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-01-24 12:24:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:24:16,185 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:16,185 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:16,185 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash 115859283, now seen corresponding path program 1 times [2018-01-24 12:24:16,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:16,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:16,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:16,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:16,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:16,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:24:16,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:16,433 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:16,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:16,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:16,479 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-01-24 12:24:16,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:16,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:16,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:24:16,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:24:16,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:24:16,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:16,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:16,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:16,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-01-24 12:24:16,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-24 12:24:16,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:16,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:16,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-01-24 12:24:16,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-01-24 12:24:16,645 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:24:16,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-24 12:24:16,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:16,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:16,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:16,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-01-24 12:24:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:24:16,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:16,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2018-01-24 12:24:16,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:24:16,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:24:16,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:24:16,693 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 22 states. [2018-01-24 12:24:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:17,118 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-01-24 12:24:17,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:24:17,118 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-01-24 12:24:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:17,119 INFO L225 Difference]: With dead ends: 87 [2018-01-24 12:24:17,119 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 12:24:17,120 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-01-24 12:24:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 12:24:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-24 12:24:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 12:24:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2018-01-24 12:24:17,133 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 43 [2018-01-24 12:24:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:17,134 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2018-01-24 12:24:17,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:24:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-01-24 12:24:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 12:24:17,134 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:17,135 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:17,135 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash -329856377, now seen corresponding path program 1 times [2018-01-24 12:24:17,135 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:17,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:17,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:17,136 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:17,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:17,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-24 12:24:17,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:17,187 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:17,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:17,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-24 12:24:17,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:24:17,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-01-24 12:24:17,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:24:17,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:24:17,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:24:17,268 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 6 states. [2018-01-24 12:24:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:17,330 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-01-24 12:24:17,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:24:17,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-24 12:24:17,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:17,331 INFO L225 Difference]: With dead ends: 91 [2018-01-24 12:24:17,331 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 12:24:17,332 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:24:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 12:24:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-24 12:24:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 12:24:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-01-24 12:24:17,343 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 45 [2018-01-24 12:24:17,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:17,343 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-01-24 12:24:17,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:24:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-01-24 12:24:17,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:24:17,344 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:17,344 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:17,344 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:17,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1632885427, now seen corresponding path program 2 times [2018-01-24 12:24:17,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:17,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:17,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:17,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:17,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:17,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 12:24:17,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:17,426 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:17,437 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:24:17,449 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:17,459 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:17,472 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:17,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 12:24:17,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:17,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-24 12:24:17,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:24:17,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:24:17,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:24:17,535 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 9 states. [2018-01-24 12:24:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:17,603 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-01-24 12:24:17,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:24:17,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-01-24 12:24:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:17,605 INFO L225 Difference]: With dead ends: 124 [2018-01-24 12:24:17,605 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 12:24:17,605 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:24:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 12:24:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2018-01-24 12:24:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-24 12:24:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-24 12:24:17,622 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 47 [2018-01-24 12:24:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:17,622 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-24 12:24:17,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:24:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-24 12:24:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:24:17,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:17,623 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:17,623 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576177, now seen corresponding path program 1 times [2018-01-24 12:24:17,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:17,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:17,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:17,625 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:17,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:17,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:24:18,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:18,019 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:18,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:18,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:18,065 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-01-24 12:24:18,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:24:18,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:18,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:18,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:24:18,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-01-24 12:24:18,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:24:18,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:24:18,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2018-01-24 12:24:18,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 12:24:18,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 12:24:18,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:31 [2018-01-24 12:24:18,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-24 12:24:18,451 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:24:18,452 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 30 treesize of output 20 [2018-01-24 12:24:18,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-01-24 12:24:18,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:18,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-24 12:24:18,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:18,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:24:18,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-24 12:24:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:18,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:18,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-01-24 12:24:18,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 12:24:18,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 12:24:18,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 12:24:18,541 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 33 states. [2018-01-24 12:24:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:20,024 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-01-24 12:24:20,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-24 12:24:20,024 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-01-24 12:24:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:20,026 INFO L225 Difference]: With dead ends: 102 [2018-01-24 12:24:20,026 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 12:24:20,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=406, Invalid=2674, Unknown=0, NotChecked=0, Total=3080 [2018-01-24 12:24:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 12:24:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-01-24 12:24:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 12:24:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-01-24 12:24:20,039 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 48 [2018-01-24 12:24:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:20,039 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-01-24 12:24:20,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 12:24:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-01-24 12:24:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:24:20,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:20,040 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:20,040 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:20,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576227, now seen corresponding path program 1 times [2018-01-24 12:24:20,041 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:20,041 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:20,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:20,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:20,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:20,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-24 12:24:20,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:20,120 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:20,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:20,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-24 12:24:20,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:20,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-01-24 12:24:20,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:24:20,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:24:20,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:24:20,191 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2018-01-24 12:24:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:20,240 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-01-24 12:24:20,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:24:20,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-01-24 12:24:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:20,241 INFO L225 Difference]: With dead ends: 108 [2018-01-24 12:24:20,241 INFO L226 Difference]: Without dead ends: 95 [2018-01-24 12:24:20,242 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:24:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-24 12:24:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-01-24 12:24:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-24 12:24:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-01-24 12:24:20,254 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 48 [2018-01-24 12:24:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:20,254 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-01-24 12:24:20,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:24:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-01-24 12:24:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:24:20,255 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:20,256 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:20,256 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:24:20,256 INFO L82 PathProgramCache]: Analyzing trace with hash 255829617, now seen corresponding path program 1 times [2018-01-24 12:24:20,256 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:20,256 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:20,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:20,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:20,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:20,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 12:24:21,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:21,306 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:21,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:21,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:21,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-24 12:24:21,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:24:21,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:21,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:21,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-24 12:24:21,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:24:21,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:21,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:24:21,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:24:21,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-01-24 12:24:21,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-01-24 12:24:21,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:21,858 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 53 treesize of output 35 [2018-01-24 12:24:21,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:21,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 12:24:21,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-01-24 12:24:22,047 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 41 DAG size of output 23 [2018-01-24 12:24:28,212 WARN L146 SmtUtils]: Spent 4047ms on a formula simplification. DAG size of input: 66 DAG size of output 66 [2018-01-24 12:24:30,313 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 64 Received shutdown request... [2018-01-24 12:24:34,425 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 12:24:34,425 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:24:34,428 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:24:34,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:24:34 BoogieIcfgContainer [2018-01-24 12:24:34,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:24:34,429 INFO L168 Benchmark]: Toolchain (without parser) took 68686.99 ms. Allocated memory was 306.2 MB in the beginning and 612.4 MB in the end (delta: 306.2 MB). Free memory was 265.3 MB in the beginning and 356.8 MB in the end (delta: -91.5 MB). Peak memory consumption was 214.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:34,430 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:24:34,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.09 ms. Allocated memory is still 306.2 MB. Free memory was 265.3 MB in the beginning and 252.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:34,431 INFO L168 Benchmark]: Boogie Preprocessor took 40.98 ms. Allocated memory is still 306.2 MB. Free memory was 252.3 MB in the beginning and 250.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:34,431 INFO L168 Benchmark]: RCFGBuilder took 246.37 ms. Allocated memory is still 306.2 MB. Free memory was 250.3 MB in the beginning and 233.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:34,431 INFO L168 Benchmark]: TraceAbstraction took 68183.98 ms. Allocated memory was 306.2 MB in the beginning and 612.4 MB in the end (delta: 306.2 MB). Free memory was 232.7 MB in the beginning and 356.8 MB in the end (delta: -124.1 MB). Peak memory consumption was 182.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:34,432 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.11 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.09 ms. Allocated memory is still 306.2 MB. Free memory was 265.3 MB in the beginning and 252.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.98 ms. Allocated memory is still 306.2 MB. Free memory was 252.3 MB in the beginning and 250.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 246.37 ms. Allocated memory is still 306.2 MB. Free memory was 250.3 MB in the beginning and 233.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 68183.98 ms. Allocated memory was 306.2 MB in the beginning and 612.4 MB in the end (delta: 306.2 MB). Free memory was 232.7 MB in the beginning and 356.8 MB in the end (delta: -124.1 MB). Peak memory consumption was 182.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 65. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 65. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 65. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 65. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 65. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 65. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 65. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 65. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 65. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 68.1s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 47.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 818 SDtfs, 1155 SDslu, 3634 SDs, 0 SdLazy, 3365 SolverSat, 231 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 37.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 690 GetRequests, 423 SyntacticMatches, 20 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=18, 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, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 222 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1079 ConstructedInterpolants, 81 QuantifiedInterpolants, 285475 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1688 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 245/395 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-24-34-440.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-24-34-440.csv Completed graceful shutdown