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_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:26:56,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:26:56,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:26:56,587 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:26:56,588 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:26:56,589 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:26:56,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:26:56,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:26:56,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:26:56,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:26:56,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:26:56,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:26:56,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:26:56,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:26:56,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:26:56,600 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:26:56,602 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:26:56,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:26:56,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:26:56,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:26:56,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:26:56,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:26:56,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:26:56,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:26:56,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:26:56,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:26:56,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:26:56,613 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:26:56,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:26:56,613 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:26:56,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:26:56,614 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_SS.epf [2018-01-28 22:26:56,623 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:26:56,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:26:56,624 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:26:56,624 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:26:56,625 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:26:56,625 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:26:56,625 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:26:56,626 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:26:56,626 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:26:56,626 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:26:56,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:26:56,626 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:26:56,626 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:26:56,627 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:26:56,627 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:26:56,627 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:26:56,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:26:56,627 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:26:56,627 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:26:56,628 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:26:56,628 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:26:56,628 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:26:56,628 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:26:56,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:26:56,628 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:26:56,629 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:26:56,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:26:56,629 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:26:56,629 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:26:56,629 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:26:56,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:26:56,630 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:26:56,630 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:26:56,631 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:26:56,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:26:56,677 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:26:56,681 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:26:56,683 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:26:56,683 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:26:56,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-01-28 22:26:56,859 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:26:56,867 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:26:56,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:26:56,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:26:56,875 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:26:56,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:26:56" (1/1) ... [2018-01-28 22:26:56,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408fc50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:56, skipping insertion in model container [2018-01-28 22:26:56,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:26:56" (1/1) ... [2018-01-28 22:26:56,898 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:26:56,951 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:26:57,093 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:26:57,111 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:26:57,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:57 WrapperNode [2018-01-28 22:26:57,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:26:57,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:26:57,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:26:57,121 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:26:57,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:57" (1/1) ... [2018-01-28 22:26:57,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:57" (1/1) ... [2018-01-28 22:26:57,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:57" (1/1) ... [2018-01-28 22:26:57,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:57" (1/1) ... [2018-01-28 22:26:57,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:57" (1/1) ... [2018-01-28 22:26:57,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:57" (1/1) ... [2018-01-28 22:26:57,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:57" (1/1) ... [2018-01-28 22:26:57,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:26:57,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:26:57,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:26:57,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:26:57,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:57" (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-28 22:26:57,228 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:26:57,228 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:26:57,228 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:26:57,228 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-28 22:26:57,228 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:26:57,228 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:26:57,229 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:26:57,229 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:26:57,229 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:26:57,229 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:26:57,229 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:26:57,229 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:26:57,229 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:26:57,230 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:26:57,230 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:26:57,230 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-28 22:26:57,230 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:26:57,230 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:26:57,230 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:26:57,230 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:26:57,490 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:26:57,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:26:57 BoogieIcfgContainer [2018-01-28 22:26:57,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:26:57,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:26:57,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:26:57,494 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:26:57,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:26:56" (1/3) ... [2018-01-28 22:26:57,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90d9661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:26:57, skipping insertion in model container [2018-01-28 22:26:57,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:26:57" (2/3) ... [2018-01-28 22:26:57,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90d9661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:26:57, skipping insertion in model container [2018-01-28 22:26:57,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:26:57" (3/3) ... [2018-01-28 22:26:57,498 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-01-28 22:26:57,505 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:26:57,510 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-28 22:26:57,551 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:26:57,551 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:26:57,551 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:26:57,551 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:26:57,552 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:26:57,552 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:26:57,552 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:26:57,552 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:26:57,553 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:26:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-28 22:26:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 22:26:57,575 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:57,575 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:26:57,575 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:26:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash -17133522, now seen corresponding path program 1 times [2018-01-28 22:26:57,580 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:57,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:57,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:57,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:57,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:57,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:57,782 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-28 22:26:57,785 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:26:57,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:26:57,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:26:57,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:26:57,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:26:57,877 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-01-28 22:26:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:26:58,023 INFO L93 Difference]: Finished difference Result 190 states and 220 transitions. [2018-01-28 22:26:58,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:26:58,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-28 22:26:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:26:58,036 INFO L225 Difference]: With dead ends: 190 [2018-01-28 22:26:58,037 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 22:26:58,039 INFO L533 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-28 22:26:58,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 22:26:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2018-01-28 22:26:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 22:26:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-28 22:26:58,078 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 23 [2018-01-28 22:26:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:26:58,078 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-28 22:26:58,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:26:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-28 22:26:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 22:26:58,080 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:58,080 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:26:58,080 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:26:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1306909630, now seen corresponding path program 1 times [2018-01-28 22:26:58,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:58,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:58,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:58,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:58,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:58,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:58,179 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-28 22:26:58,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:26:58,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:26:58,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:26:58,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:26:58,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:26:58,182 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 6 states. [2018-01-28 22:26:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:26:58,260 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-01-28 22:26:58,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:26:58,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-28 22:26:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:26:58,263 INFO L225 Difference]: With dead ends: 104 [2018-01-28 22:26:58,263 INFO L226 Difference]: Without dead ends: 100 [2018-01-28 22:26:58,264 INFO L533 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-28 22:26:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-28 22:26:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2018-01-28 22:26:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-28 22:26:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-28 22:26:58,274 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 24 [2018-01-28 22:26:58,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:26:58,275 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-28 22:26:58,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:26:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-28 22:26:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 22:26:58,276 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:58,276 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:26:58,276 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:26:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash -557884516, now seen corresponding path program 1 times [2018-01-28 22:26:58,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:58,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:58,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:58,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:58,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:58,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:58,367 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-28 22:26:58,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:26:58,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:26:58,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:26:58,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:26:58,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:26:58,369 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-01-28 22:26:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:26:58,465 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-01-28 22:26:58,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:26:58,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-28 22:26:58,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:26:58,467 INFO L225 Difference]: With dead ends: 150 [2018-01-28 22:26:58,467 INFO L226 Difference]: Without dead ends: 81 [2018-01-28 22:26:58,468 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:26:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-28 22:26:58,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-28 22:26:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-28 22:26:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-01-28 22:26:58,477 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 24 [2018-01-28 22:26:58,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:26:58,477 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-01-28 22:26:58,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:26:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-01-28 22:26:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:26:58,478 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:58,479 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:26:58,479 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:26:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1832747532, now seen corresponding path program 1 times [2018-01-28 22:26:58,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:58,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:58,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:58,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:58,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:58,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:58,553 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-28 22:26:58,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:26:58,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:26:58,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:26:58,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:26:58,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:26:58,554 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 6 states. [2018-01-28 22:26:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:26:58,673 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-28 22:26:58,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:26:58,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-28 22:26:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:26:58,675 INFO L225 Difference]: With dead ends: 81 [2018-01-28 22:26:58,675 INFO L226 Difference]: Without dead ends: 80 [2018-01-28 22:26:58,676 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:26:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-28 22:26:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-28 22:26:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-28 22:26:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-01-28 22:26:58,684 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 25 [2018-01-28 22:26:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:26:58,684 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-01-28 22:26:58,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:26:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-01-28 22:26:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:26:58,685 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:58,686 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:26:58,686 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:26:58,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1832747533, now seen corresponding path program 1 times [2018-01-28 22:26:58,686 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:58,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:58,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:58,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:58,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:58,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:58,982 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-28 22:26:58,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:26:58,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:26:58,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:26:58,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:26:58,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:26:58,984 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 9 states. [2018-01-28 22:26:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:26:59,238 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-28 22:26:59,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:26:59,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-28 22:26:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:26:59,240 INFO L225 Difference]: With dead ends: 145 [2018-01-28 22:26:59,241 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 22:26:59,241 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:26:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 22:26:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-01-28 22:26:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 22:26:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-28 22:26:59,250 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 25 [2018-01-28 22:26:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:26:59,250 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-28 22:26:59,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:26:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-28 22:26:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 22:26:59,252 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:59,252 INFO L330 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] [2018-01-28 22:26:59,252 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:26:59,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1263716541, now seen corresponding path program 1 times [2018-01-28 22:26:59,253 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:59,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:59,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:59,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:59,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:59,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:26:59,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:26:59,532 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-28 22:26:59,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:59,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:26:59,630 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 20 treesize of output 19 [2018-01-28 22:26:59,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:59,644 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 17 treesize of output 16 [2018-01-28 22:26:59,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:59,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:26:59,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:26:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:00,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:27:00,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-28 22:27:00,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 22:27:00,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 22:27:00,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:27:00,005 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 20 states. [2018-01-28 22:27:00,397 WARN L143 SmtUtils]: Spent 252ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-28 22:27:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:00,674 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-01-28 22:27:00,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:27:00,675 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-28 22:27:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:00,676 INFO L225 Difference]: With dead ends: 151 [2018-01-28 22:27:00,676 INFO L226 Difference]: Without dead ends: 91 [2018-01-28 22:27:00,676 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:27:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-28 22:27:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-01-28 22:27:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-28 22:27:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-01-28 22:27:00,685 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 31 [2018-01-28 22:27:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:00,686 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-01-28 22:27:00,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 22:27:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2018-01-28 22:27:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 22:27:00,687 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:00,687 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:27:00,687 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1565633529, now seen corresponding path program 2 times [2018-01-28 22:27:00,687 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:00,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:00,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:00,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:27:00,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:00,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:01,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:27:01,001 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-28 22:27:01,012 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:27:01,028 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:27:01,032 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:27:01,033 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:27:01,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:27:01,055 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 20 treesize of output 19 [2018-01-28 22:27:01,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:01,084 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 17 treesize of output 16 [2018-01-28 22:27:01,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:01,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:27:01,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:27:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:01,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:27:01,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-01-28 22:27:01,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 22:27:01,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 22:27:01,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:27:01,478 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 24 states. [2018-01-28 22:27:03,165 WARN L143 SmtUtils]: Spent 1563ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-28 22:27:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:03,619 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-01-28 22:27:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:27:03,620 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-28 22:27:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:03,622 INFO L225 Difference]: With dead ends: 157 [2018-01-28 22:27:03,622 INFO L226 Difference]: Without dead ends: 97 [2018-01-28 22:27:03,623 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2018-01-28 22:27:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-28 22:27:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-01-28 22:27:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-28 22:27:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-28 22:27:03,633 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 37 [2018-01-28 22:27:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:03,633 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-28 22:27:03,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-28 22:27:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-28 22:27:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:27:03,635 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:03,635 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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-28 22:27:03,635 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash -377667537, now seen corresponding path program 3 times [2018-01-28 22:27:03,635 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:03,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:03,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:03,637 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:27:03,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:03,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:04,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:27:04,084 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-28 22:27:04,090 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:27:04,100 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:27:04,103 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:27:04,104 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:27:04,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:27:04,135 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 17 treesize of output 16 [2018-01-28 22:27:04,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:04,146 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 20 treesize of output 19 [2018-01-28 22:27:04,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:04,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:27:04,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:27:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-28 22:27:06,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:27:06,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-01-28 22:27:06,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 22:27:06,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 22:27:06,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=636, Unknown=1, NotChecked=0, Total=702 [2018-01-28 22:27:06,579 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 27 states. [2018-01-28 22:27:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:09,066 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-01-28 22:27:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 22:27:09,084 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-28 22:27:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:09,085 INFO L225 Difference]: With dead ends: 162 [2018-01-28 22:27:09,086 INFO L226 Difference]: Without dead ends: 102 [2018-01-28 22:27:09,087 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=358, Invalid=1897, Unknown=1, NotChecked=0, Total=2256 [2018-01-28 22:27:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-28 22:27:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-01-28 22:27:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 22:27:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-01-28 22:27:09,096 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 43 [2018-01-28 22:27:09,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:09,096 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-01-28 22:27:09,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 22:27:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-01-28 22:27:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 22:27:09,097 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:09,098 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:27:09,098 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash 475868511, now seen corresponding path program 1 times [2018-01-28 22:27:09,098 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:09,098 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:09,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:09,100 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:27:09,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:09,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-28 22:27:09,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:27:09,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:27:09,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:27:09,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:27:09,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:27:09,214 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 6 states. [2018-01-28 22:27:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:09,339 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-01-28 22:27:09,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:27:09,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-01-28 22:27:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:09,341 INFO L225 Difference]: With dead ends: 99 [2018-01-28 22:27:09,341 INFO L226 Difference]: Without dead ends: 98 [2018-01-28 22:27:09,342 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:27:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-28 22:27:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-28 22:27:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 22:27:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-01-28 22:27:09,348 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 62 [2018-01-28 22:27:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:09,349 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-01-28 22:27:09,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:27:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-01-28 22:27:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 22:27:09,350 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:09,350 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:27:09,350 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:09,351 INFO L82 PathProgramCache]: Analyzing trace with hash 475868512, now seen corresponding path program 1 times [2018-01-28 22:27:09,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:09,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:09,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:09,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:27:09,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:09,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-28 22:27:09,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:27:09,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:27:09,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:27:09,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:27:09,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:27:09,397 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 4 states. [2018-01-28 22:27:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:09,531 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2018-01-28 22:27:09,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:27:09,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-01-28 22:27:09,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:09,534 INFO L225 Difference]: With dead ends: 127 [2018-01-28 22:27:09,534 INFO L226 Difference]: Without dead ends: 126 [2018-01-28 22:27:09,534 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:27:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-28 22:27:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2018-01-28 22:27:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-28 22:27:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2018-01-28 22:27:09,540 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 62 [2018-01-28 22:27:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:09,541 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2018-01-28 22:27:09,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:27:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2018-01-28 22:27:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-28 22:27:09,542 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:09,542 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:27:09,542 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:09,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1088143582, now seen corresponding path program 1 times [2018-01-28 22:27:09,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:09,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:09,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:09,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:27:09,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:09,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:09,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:27:09,698 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-28 22:27:09,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:27:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:09,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:27:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:09,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:27:09,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-28 22:27:09,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:27:09,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:27:09,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:27:09,882 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 21 states. [2018-01-28 22:27:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:10,027 INFO L93 Difference]: Finished difference Result 205 states and 228 transitions. [2018-01-28 22:27:10,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:27:10,028 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-01-28 22:27:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:10,029 INFO L225 Difference]: With dead ends: 205 [2018-01-28 22:27:10,029 INFO L226 Difference]: Without dead ends: 127 [2018-01-28 22:27:10,029 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:27:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-28 22:27:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-01-28 22:27:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-28 22:27:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-28 22:27:10,038 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 65 [2018-01-28 22:27:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:10,038 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-28 22:27:10,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:27:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-28 22:27:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-28 22:27:10,040 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:10,040 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:27:10,040 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1815869864, now seen corresponding path program 2 times [2018-01-28 22:27:10,040 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:10,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:10,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:10,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:27:10,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:10,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:10,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:27:10,238 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-28 22:27:10,244 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:27:10,259 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:27:10,262 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:27:10,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:27:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-28 22:27:10,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:27:10,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2018-01-28 22:27:10,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 22:27:10,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 22:27:10,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:27:10,341 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 17 states. [2018-01-28 22:27:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:10,659 INFO L93 Difference]: Finished difference Result 256 states and 288 transitions. [2018-01-28 22:27:10,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 22:27:10,659 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-01-28 22:27:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:10,661 INFO L225 Difference]: With dead ends: 256 [2018-01-28 22:27:10,661 INFO L226 Difference]: Without dead ends: 175 [2018-01-28 22:27:10,661 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:27:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-28 22:27:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2018-01-28 22:27:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-28 22:27:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-01-28 22:27:10,670 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 71 [2018-01-28 22:27:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:10,670 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-01-28 22:27:10,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 22:27:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-01-28 22:27:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-28 22:27:10,671 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:10,671 INFO L330 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:27:10,671 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:10,671 INFO L82 PathProgramCache]: Analyzing trace with hash -587596373, now seen corresponding path program 1 times [2018-01-28 22:27:10,672 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:10,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:10,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:10,672 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:27:10,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:10,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-28 22:27:10,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:27:10,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:27:10,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:27:10,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:27:10,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:27:10,796 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 5 states. [2018-01-28 22:27:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:10,826 INFO L93 Difference]: Finished difference Result 202 states and 222 transitions. [2018-01-28 22:27:10,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:27:10,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-01-28 22:27:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:10,828 INFO L225 Difference]: With dead ends: 202 [2018-01-28 22:27:10,828 INFO L226 Difference]: Without dead ends: 130 [2018-01-28 22:27:10,828 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:27:10,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-28 22:27:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-01-28 22:27:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-28 22:27:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-01-28 22:27:10,838 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 80 [2018-01-28 22:27:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:10,838 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-01-28 22:27:10,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:27:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-01-28 22:27:10,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 22:27:10,839 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:10,840 INFO L330 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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, 1, 1, 1] [2018-01-28 22:27:10,840 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1983731205, now seen corresponding path program 1 times [2018-01-28 22:27:10,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:10,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:10,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:10,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:27:10,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:10,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:27:11,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:27:11,011 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-28 22:27:11,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:27:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:11,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:27:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:11,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:27:11,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-28 22:27:11,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 22:27:11,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 22:27:11,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:27:11,259 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 29 states. [2018-01-28 22:27:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:11,443 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2018-01-28 22:27:11,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 22:27:11,443 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-28 22:27:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:11,444 INFO L225 Difference]: With dead ends: 213 [2018-01-28 22:27:11,444 INFO L226 Difference]: Without dead ends: 137 [2018-01-28 22:27:11,445 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 22:27:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-28 22:27:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-01-28 22:27:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-28 22:27:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-01-28 22:27:11,452 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 81 [2018-01-28 22:27:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:11,452 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-01-28 22:27:11,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 22:27:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-01-28 22:27:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-28 22:27:11,453 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:11,453 INFO L330 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 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, 1, 1, 1] [2018-01-28 22:27:11,453 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:11,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1011085627, now seen corresponding path program 2 times [2018-01-28 22:27:11,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:11,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:11,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:11,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:27:11,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:11,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:27:11,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:27:11,642 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-28 22:27:11,649 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:27:11,661 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:27:11,671 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:27:11,673 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:27:11,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:27:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 8 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:11,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:27:11,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-28 22:27:11,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 22:27:11,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 22:27:11,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:27:11,853 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 33 states. [2018-01-28 22:27:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:12,071 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2018-01-28 22:27:12,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 22:27:12,071 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-01-28 22:27:12,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:12,072 INFO L225 Difference]: With dead ends: 219 [2018-01-28 22:27:12,072 INFO L226 Difference]: Without dead ends: 143 [2018-01-28 22:27:12,073 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=626, Invalid=1536, Unknown=0, NotChecked=0, Total=2162 [2018-01-28 22:27:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-28 22:27:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-01-28 22:27:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-28 22:27:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-01-28 22:27:12,081 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 87 [2018-01-28 22:27:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:12,081 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-01-28 22:27:12,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 22:27:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-01-28 22:27:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-28 22:27:12,082 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:12,082 INFO L330 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 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, 1, 1, 1] [2018-01-28 22:27:12,082 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:12,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1950010353, now seen corresponding path program 3 times [2018-01-28 22:27:12,082 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:12,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:12,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:12,083 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:27:12,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:12,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:27:12,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:27:12,317 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-28 22:27:12,322 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:27:12,334 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:27:12,352 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:27:12,361 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:27:12,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:27:12,382 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-28 22:27:12,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:12,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:27:12,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:27:12,466 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-01-28 22:27:12,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-01-28 22:27:12,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:12,474 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-28 22:27:12,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-28 22:27:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 3 not checked. [2018-01-28 22:27:12,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:27:12,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2018-01-28 22:27:12,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-28 22:27:12,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-28 22:27:12,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=586, Unknown=1, NotChecked=50, Total=756 [2018-01-28 22:27:12,516 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 28 states. [2018-01-28 22:27:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:13,281 INFO L93 Difference]: Finished difference Result 241 states and 262 transitions. [2018-01-28 22:27:13,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-28 22:27:13,281 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-01-28 22:27:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:13,282 INFO L225 Difference]: With dead ends: 241 [2018-01-28 22:27:13,282 INFO L226 Difference]: Without dead ends: 165 [2018-01-28 22:27:13,284 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=719, Invalid=2943, Unknown=2, NotChecked=118, Total=3782 [2018-01-28 22:27:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-28 22:27:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 139. [2018-01-28 22:27:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-28 22:27:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2018-01-28 22:27:13,293 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 93 [2018-01-28 22:27:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:13,293 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2018-01-28 22:27:13,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-28 22:27:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-01-28 22:27:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-28 22:27:13,294 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:13,294 INFO L330 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 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, 1, 1, 1] [2018-01-28 22:27:13,295 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash 97797672, now seen corresponding path program 1 times [2018-01-28 22:27:13,295 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:13,295 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:13,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:13,296 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:27:13,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:13,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:27:13,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:27:13,640 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-28 22:27:13,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:27:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:13,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:27:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:13,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:27:13,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-28 22:27:13,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-28 22:27:13,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-28 22:27:13,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 22:27:13,900 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand 41 states. [2018-01-28 22:27:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:27:14,220 INFO L93 Difference]: Finished difference Result 217 states and 228 transitions. [2018-01-28 22:27:14,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 22:27:14,695 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-28 22:27:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:27:14,696 INFO L225 Difference]: With dead ends: 217 [2018-01-28 22:27:14,696 INFO L226 Difference]: Without dead ends: 148 [2018-01-28 22:27:14,697 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=997, Invalid=2543, Unknown=0, NotChecked=0, Total=3540 [2018-01-28 22:27:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-28 22:27:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-01-28 22:27:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-28 22:27:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 151 transitions. [2018-01-28 22:27:14,705 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 151 transitions. Word has length 99 [2018-01-28 22:27:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:27:14,705 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 151 transitions. [2018-01-28 22:27:14,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-28 22:27:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2018-01-28 22:27:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-28 22:27:14,706 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:27:14,706 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1] [2018-01-28 22:27:14,706 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:27:14,706 INFO L82 PathProgramCache]: Analyzing trace with hash 561692638, now seen corresponding path program 2 times [2018-01-28 22:27:14,706 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:27:14,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:27:14,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:14,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:27:14,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:27:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:27:14,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:27:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 167 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-01-28 22:27:15,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:27:15,406 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-28 22:27:15,411 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:27:15,424 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:27:15,437 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:27:15,440 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:27:15,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:27:15,448 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 20 treesize of output 19 [2018-01-28 22:27:15,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:15,463 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-28 22:27:15,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:15,465 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 19 treesize of output 18 [2018-01-28 22:27:15,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:15,478 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-28 22:27:15,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:15,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:27:15,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-28 22:27:17,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:27:17,933 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:27:17,936 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 57 treesize of output 51 [2018-01-28 22:27:17,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:17,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:27:17,977 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 51 treesize of output 60 [2018-01-28 22:27:17,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:18,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:27:18,028 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 55 treesize of output 58 [2018-01-28 22:27:18,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:18,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:27:18,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:27:18,067 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-28 22:27:18,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:27:18,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-28 22:27:18,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-28 22:27:20,247 WARN L143 SmtUtils]: Spent 2033ms on a formula simplification that was a NOOP. DAG size: 60 [2018-01-28 22:27:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 213 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:27:20,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:27:20,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 32] total 54 [2018-01-28 22:27:20,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-28 22:27:20,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-28 22:27:20,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2744, Unknown=3, NotChecked=0, Total=2970 [2018-01-28 22:27:20,337 INFO L87 Difference]: Start difference. First operand 145 states and 151 transitions. Second operand 55 states. [2018-01-28 22:27:22,774 WARN L146 SmtUtils]: Spent 2120ms on a formula simplification. DAG size of input: 73 DAG size of output 70 [2018-01-28 22:27:25,057 WARN L146 SmtUtils]: Spent 2122ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-01-28 22:27:29,158 WARN L146 SmtUtils]: Spent 4056ms on a formula simplification. DAG size of input: 59 DAG size of output 52 [2018-01-28 22:27:33,292 WARN L146 SmtUtils]: Spent 4066ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-01-28 22:27:33,721 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 76 DAG size of output 65 [2018-01-28 22:27:35,886 WARN L146 SmtUtils]: Spent 2086ms on a formula simplification. DAG size of input: 77 DAG size of output 64 [2018-01-28 22:27:38,357 WARN L146 SmtUtils]: Spent 2109ms on a formula simplification. DAG size of input: 80 DAG size of output 71 [2018-01-28 22:27:40,559 WARN L146 SmtUtils]: Spent 2117ms on a formula simplification. DAG size of input: 82 DAG size of output 74 [2018-01-28 22:27:41,058 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 79 DAG size of output 70 [2018-01-28 22:27:41,257 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-28 22:27:43,382 WARN L146 SmtUtils]: Spent 2071ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-28 22:27:43,610 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 68 DAG size of output 64 [2018-01-28 22:27:43,824 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-01-28 22:27:44,563 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-01-28 22:27:45,666 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 68 DAG size of output 64 [2018-01-28 22:27:46,043 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-28 22:28:24,132 WARN L146 SmtUtils]: Spent 25322ms on a formula simplification. DAG size of input: 81 DAG size of output 78 [2018-01-28 22:28:44,491 WARN L146 SmtUtils]: Spent 20255ms on a formula simplification. DAG size of input: 85 DAG size of output 76 [2018-01-28 22:28:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:28:51,515 INFO L93 Difference]: Finished difference Result 256 states and 273 transitions. [2018-01-28 22:28:51,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-28 22:28:51,515 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 105 [2018-01-28 22:28:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:28:51,516 INFO L225 Difference]: With dead ends: 256 [2018-01-28 22:28:51,516 INFO L226 Difference]: Without dead ends: 255 [2018-01-28 22:28:51,519 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3370 ImplicationChecksByTransitivity, 83.7s TimeCoverageRelationStatistics Valid=1532, Invalid=11796, Unknown=12, NotChecked=0, Total=13340 [2018-01-28 22:28:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-28 22:28:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 150. [2018-01-28 22:28:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-28 22:28:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-28 22:28:51,534 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 105 [2018-01-28 22:28:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:28:51,534 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-28 22:28:51,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-28 22:28:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-28 22:28:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-28 22:28:51,535 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:28:51,535 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:28:51,535 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:28:51,535 INFO L82 PathProgramCache]: Analyzing trace with hash 422192379, now seen corresponding path program 1 times [2018-01-28 22:28:51,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:28:51,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:28:51,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:28:51,536 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:28:51,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:28:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:28:51,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:28:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-28 22:28:51,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:28:51,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:28:51,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:28:51,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:28:51,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:28:51,600 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-01-28 22:28:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:28:51,700 INFO L93 Difference]: Finished difference Result 188 states and 198 transitions. [2018-01-28 22:28:51,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:28:51,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-01-28 22:28:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:28:51,701 INFO L225 Difference]: With dead ends: 188 [2018-01-28 22:28:51,701 INFO L226 Difference]: Without dead ends: 163 [2018-01-28 22:28:51,701 INFO L533 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-28 22:28:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-28 22:28:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2018-01-28 22:28:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-28 22:28:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2018-01-28 22:28:51,717 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 107 [2018-01-28 22:28:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:28:51,718 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2018-01-28 22:28:51,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:28:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2018-01-28 22:28:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-28 22:28:51,718 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:28:51,718 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:28:51,718 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:28:51,719 INFO L82 PathProgramCache]: Analyzing trace with hash 806275120, now seen corresponding path program 1 times [2018-01-28 22:28:51,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:28:51,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:28:51,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:28:51,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:28:51,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:28:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:28:51,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:28:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-01-28 22:28:51,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:28:51,929 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-28 22:28:51,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:28:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:28:51,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:28:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-01-28 22:28:52,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:28:52,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-28 22:28:52,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:28:52,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:28:52,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-28 22:28:52,157 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 13 states. [2018-01-28 22:28:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:28:52,732 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2018-01-28 22:28:52,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:28:52,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-01-28 22:28:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:28:52,734 INFO L225 Difference]: With dead ends: 169 [2018-01-28 22:28:52,734 INFO L226 Difference]: Without dead ends: 153 [2018-01-28 22:28:52,734 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=274, Unknown=9, NotChecked=0, Total=342 [2018-01-28 22:28:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-28 22:28:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-01-28 22:28:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-28 22:28:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2018-01-28 22:28:52,764 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 115 [2018-01-28 22:28:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:28:52,764 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2018-01-28 22:28:52,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:28:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2018-01-28 22:28:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-28 22:28:52,765 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:28:52,765 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:28:52,766 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:28:52,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1246631654, now seen corresponding path program 1 times [2018-01-28 22:28:52,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:28:52,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:28:52,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:28:52,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:28:52,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:28:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:28:52,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:28:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-28 22:28:52,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:28:52,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:28:52,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:28:52,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:28:52,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:28:52,893 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand 6 states. [2018-01-28 22:28:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:28:52,951 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2018-01-28 22:28:52,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:28:52,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2018-01-28 22:28:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:28:52,953 INFO L225 Difference]: With dead ends: 189 [2018-01-28 22:28:52,953 INFO L226 Difference]: Without dead ends: 152 [2018-01-28 22:28:52,953 INFO L533 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-28 22:28:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-28 22:28:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-01-28 22:28:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-28 22:28:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-01-28 22:28:52,979 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 116 [2018-01-28 22:28:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:28:52,980 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-01-28 22:28:52,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:28:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-01-28 22:28:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-28 22:28:52,981 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:28:52,981 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:28:52,981 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:28:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash -309581918, now seen corresponding path program 1 times [2018-01-28 22:28:52,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:28:52,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:28:52,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:28:52,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:28:52,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:28:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:28:53,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:28:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-01-28 22:28:53,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:28:53,129 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-28 22:28:53,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:28:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:28:53,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:28:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-01-28 22:28:53,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:28:53,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-01-28 22:28:53,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:28:53,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:28:53,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:28:53,279 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 11 states. [2018-01-28 22:28:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:28:53,414 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2018-01-28 22:28:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:28:53,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 119 [2018-01-28 22:28:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:28:53,416 INFO L225 Difference]: With dead ends: 199 [2018-01-28 22:28:53,416 INFO L226 Difference]: Without dead ends: 189 [2018-01-28 22:28:53,417 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:28:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-28 22:28:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2018-01-28 22:28:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-28 22:28:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 161 transitions. [2018-01-28 22:28:53,443 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 161 transitions. Word has length 119 [2018-01-28 22:28:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:28:53,443 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 161 transitions. [2018-01-28 22:28:53,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:28:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 161 transitions. [2018-01-28 22:28:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-28 22:28:53,444 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:28:53,445 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:28:53,445 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:28:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2014250650, now seen corresponding path program 1 times [2018-01-28 22:28:53,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:28:53,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:28:53,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:28:53,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:28:53,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:28:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:28:53,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:28:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 10 proven. 135 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-01-28 22:28:54,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:28:54,471 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-28 22:28:54,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:28:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:28:54,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:28:54,512 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-28 22:28:54,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:54,513 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 20 treesize of output 19 [2018-01-28 22:28:54,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:54,526 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-28 22:28:54,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:54,538 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 19 treesize of output 18 [2018-01-28 22:28:54,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:54,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:28:54,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-28 22:28:56,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:56,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:56,777 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 57 treesize of output 51 [2018-01-28 22:28:56,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:56,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:56,813 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 55 treesize of output 58 [2018-01-28 22:28:56,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:56,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:56,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:56,849 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-28 22:28:56,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:56,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:56,880 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 51 treesize of output 60 [2018-01-28 22:28:56,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:56,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-28 22:28:56,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-28 22:28:57,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:57,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:57,595 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 71 treesize of output 65 [2018-01-28 22:28:57,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:57,700 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:57,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:57,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:57,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 92 [2018-01-28 22:28:57,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:28:57,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:57,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:57,866 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 73 treesize of output 67 [2018-01-28 22:28:57,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:57,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:57,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:57,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:57,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 100 [2018-01-28 22:28:58,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 22:28:58,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,190 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 2 case distinctions, treesize of input 71 treesize of output 78 [2018-01-28 22:28:58,190 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-28 22:28:58,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 90 [2018-01-28 22:28:58,424 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-28 22:28:58,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,671 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 62 treesize of output 56 [2018-01-28 22:28:58,672 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:58,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,675 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 70 treesize of output 64 [2018-01-28 22:28:58,676 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:58,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,894 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 62 treesize of output 56 [2018-01-28 22:28:58,895 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:58,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:28:58,897 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 68 treesize of output 62 [2018-01-28 22:28:58,898 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:28:59,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 40 dim-0 vars, and 8 xjuncts. [2018-01-28 22:28:59,110 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 32 variables, input treesize:285, output treesize:437 [2018-01-28 22:28:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 218 proven. 95 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:28:59,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:28:59,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 36] total 59 [2018-01-28 22:28:59,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-28 22:28:59,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-28 22:28:59,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3300, Unknown=1, NotChecked=0, Total=3540 [2018-01-28 22:28:59,564 INFO L87 Difference]: Start difference. First operand 155 states and 161 transitions. Second operand 60 states. [2018-01-28 22:29:02,012 WARN L146 SmtUtils]: Spent 2115ms on a formula simplification. DAG size of input: 74 DAG size of output 71 [2018-01-28 22:29:06,301 WARN L146 SmtUtils]: Spent 4117ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-01-28 22:29:08,530 WARN L146 SmtUtils]: Spent 2053ms on a formula simplification. DAG size of input: 62 DAG size of output 55 [2018-01-28 22:29:13,021 WARN L146 SmtUtils]: Spent 4096ms on a formula simplification. DAG size of input: 78 DAG size of output 67 [2018-01-28 22:29:17,151 WARN L146 SmtUtils]: Spent 4075ms on a formula simplification. DAG size of input: 70 DAG size of output 65 [2018-01-28 22:29:19,483 WARN L146 SmtUtils]: Spent 2099ms on a formula simplification. DAG size of input: 79 DAG size of output 70 Received shutdown request... [2018-01-28 22:29:21,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 22:29:21,772 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:29:21,776 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:29:21,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:29:21 BoogieIcfgContainer [2018-01-28 22:29:21,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:29:21,777 INFO L168 Benchmark]: Toolchain (without parser) took 144917.93 ms. Allocated memory was 305.7 MB in the beginning and 583.0 MB in the end (delta: 277.3 MB). Free memory was 264.5 MB in the beginning and 423.7 MB in the end (delta: -159.2 MB). Peak memory consumption was 118.2 MB. Max. memory is 5.3 GB. [2018-01-28 22:29:21,778 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:29:21,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.65 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 250.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:29:21,779 INFO L168 Benchmark]: Boogie Preprocessor took 40.10 ms. Allocated memory is still 305.7 MB. Free memory was 250.6 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:29:21,779 INFO L168 Benchmark]: RCFGBuilder took 329.92 ms. Allocated memory is still 305.7 MB. Free memory was 248.6 MB in the beginning and 227.5 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-01-28 22:29:21,780 INFO L168 Benchmark]: TraceAbstraction took 144284.52 ms. Allocated memory was 305.7 MB in the beginning and 583.0 MB in the end (delta: 277.3 MB). Free memory was 225.5 MB in the beginning and 423.7 MB in the end (delta: -198.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 5.3 GB. [2018-01-28 22:29:21,781 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 252.65 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 250.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.10 ms. Allocated memory is still 305.7 MB. Free memory was 250.6 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 329.92 ms. Allocated memory is still 305.7 MB. Free memory was 248.6 MB in the beginning and 227.5 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 144284.52 ms. Allocated memory was 305.7 MB in the beginning and 583.0 MB in the end (delta: 277.3 MB). Free memory was 225.5 MB in the beginning and 423.7 MB in the end (delta: -198.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1471]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1471). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 19 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 82 locations, 13 error locations. TIMEOUT Result, 144.2s OverallTime, 23 OverallIterations, 11 TraceHistogramMax, 123.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1715 SDtfs, 2028 SDslu, 14369 SDs, 0 SdLazy, 6483 SolverSat, 370 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1580 GetRequests, 936 SyntacticMatches, 9 SemanticMatches, 634 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9041 ImplicationChecksByTransitivity, 119.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 309 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 2686 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2650 ConstructedInterpolants, 222 QuantifiedInterpolants, 2475616 SizeOfPredicates, 163 NumberOfNonLiveVariables, 2603 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 36 InterpolantComputations, 11 PerfectInterpolantSequences, 3065/4912 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-29-21-790.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-29-21-790.csv Completed graceful shutdown