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_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:20:55,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:20:55,731 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:20:55,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:20:55,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:20:55,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:20:55,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:20:55,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:20:55,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:20:55,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:20:55,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:20:55,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:20:55,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:20:55,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:20:55,758 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:20:55,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:20:55,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:20:55,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:20:55,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:20:55,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:20:55,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:20:55,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:20:55,771 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:20:55,772 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:20:55,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:20:55,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:20:55,774 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:20:55,775 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:20:55,775 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:20:55,775 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:20:55,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:20:55,776 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:20:55,786 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:20:55,786 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:20:55,787 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:20:55,787 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:20:55,787 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:20:55,787 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:20:55,787 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:20:55,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:20:55,788 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:20:55,788 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:20:55,788 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:20:55,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:20:55,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:20:55,789 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:20:55,789 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:20:55,789 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:20:55,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:20:55,789 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:20:55,789 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:20:55,789 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:20:55,790 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:20:55,790 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:20:55,790 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:20:55,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:20:55,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:20:55,791 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:20:55,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:20:55,791 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:20:55,791 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:20:55,791 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:20:55,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:20:55,791 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:20:55,792 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:20:55,792 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:20:55,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:20:55,837 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:20:55,841 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:20:55,843 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:20:55,843 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:20:55,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-01-28 22:20:56,037 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:20:56,044 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:20:56,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:20:56,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:20:56,049 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:20:56,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:20:56" (1/1) ... [2018-01-28 22:20:56,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fe8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56, skipping insertion in model container [2018-01-28 22:20:56,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:20:56" (1/1) ... [2018-01-28 22:20:56,074 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:20:56,131 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:20:56,250 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:20:56,267 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:20:56,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56 WrapperNode [2018-01-28 22:20:56,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:20:56,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:20:56,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:20:56,276 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:20:56,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56" (1/1) ... [2018-01-28 22:20:56,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56" (1/1) ... [2018-01-28 22:20:56,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56" (1/1) ... [2018-01-28 22:20:56,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56" (1/1) ... [2018-01-28 22:20:56,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56" (1/1) ... [2018-01-28 22:20:56,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56" (1/1) ... [2018-01-28 22:20:56,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56" (1/1) ... [2018-01-28 22:20:56,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:20:56,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:20:56,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:20:56,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:20:56,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56" (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:20:56,387 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:20:56,387 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:20:56,388 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:20:56,388 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-28 22:20:56,388 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-28 22:20:56,388 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:20:56,388 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:20:56,388 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:20:56,388 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:20:56,389 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:20:56,389 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:20:56,389 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:20:56,389 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:20:56,389 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:20:56,389 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:20:56,389 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:20:56,390 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-28 22:20:56,390 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-28 22:20:56,390 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:20:56,390 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:20:56,390 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:20:56,390 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:20:56,713 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:20:56,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:20:56 BoogieIcfgContainer [2018-01-28 22:20:56,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:20:56,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:20:56,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:20:56,717 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:20:56,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:20:56" (1/3) ... [2018-01-28 22:20:56,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f2335a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:20:56, skipping insertion in model container [2018-01-28 22:20:56,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:20:56" (2/3) ... [2018-01-28 22:20:56,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f2335a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:20:56, skipping insertion in model container [2018-01-28 22:20:56,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:20:56" (3/3) ... [2018-01-28 22:20:56,722 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-28 22:20:56,729 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:20:56,736 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-28 22:20:56,775 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:20:56,775 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:20:56,775 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:20:56,775 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:20:56,776 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:20:56,776 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:20:56,776 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:20:56,776 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:20:56,776 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:20:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-28 22:20:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 22:20:56,800 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:20:56,801 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:20:56,802 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:20:56,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1597802234, now seen corresponding path program 1 times [2018-01-28 22:20:56,807 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:20:56,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:20:56,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:56,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:20:56,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:20:56,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:20:57,016 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:20:57,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:20:57,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:20:57,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:20:57,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:20:57,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:20:57,114 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 3 states. [2018-01-28 22:20:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:20:57,337 INFO L93 Difference]: Finished difference Result 230 states and 270 transitions. [2018-01-28 22:20:57,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:20:57,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-28 22:20:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:20:57,350 INFO L225 Difference]: With dead ends: 230 [2018-01-28 22:20:57,350 INFO L226 Difference]: Without dead ends: 149 [2018-01-28 22:20:57,355 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:20:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-28 22:20:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 99. [2018-01-28 22:20:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 22:20:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-28 22:20:57,404 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 23 [2018-01-28 22:20:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:20:57,404 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-28 22:20:57,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:20:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-28 22:20:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 22:20:57,406 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:20:57,406 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:20:57,407 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:20:57,407 INFO L82 PathProgramCache]: Analyzing trace with hash -442809342, now seen corresponding path program 1 times [2018-01-28 22:20:57,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:20:57,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:20:57,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:57,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:20:57,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:20:57,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:20:57,506 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:20:57,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:20:57,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:20:57,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:20:57,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:20:57,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:20:57,509 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 6 states. [2018-01-28 22:20:57,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:20:57,603 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2018-01-28 22:20:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:20:57,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-28 22:20:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:20:57,608 INFO L225 Difference]: With dead ends: 120 [2018-01-28 22:20:57,608 INFO L226 Difference]: Without dead ends: 116 [2018-01-28 22:20:57,609 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:20:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-28 22:20:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2018-01-28 22:20:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-28 22:20:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-01-28 22:20:57,620 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 24 [2018-01-28 22:20:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:20:57,621 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-01-28 22:20:57,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:20:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-01-28 22:20:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 22:20:57,622 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:20:57,622 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:20:57,622 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:20:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2007837378, now seen corresponding path program 1 times [2018-01-28 22:20:57,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:20:57,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:20:57,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:57,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:20:57,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:20:57,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:20:57,704 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:20:57,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:20:57,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:20:57,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:20:57,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:20:57,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:20:57,706 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 5 states. [2018-01-28 22:20:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:20:57,744 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-01-28 22:20:57,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:20:57,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-28 22:20:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:20:57,746 INFO L225 Difference]: With dead ends: 180 [2018-01-28 22:20:57,746 INFO L226 Difference]: Without dead ends: 96 [2018-01-28 22:20:57,747 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:20:57,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-28 22:20:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-28 22:20:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-28 22:20:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-01-28 22:20:57,757 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 24 [2018-01-28 22:20:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:20:57,757 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-01-28 22:20:57,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:20:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-01-28 22:20:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:20:57,759 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:20:57,759 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:20:57,759 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:20:57,760 INFO L82 PathProgramCache]: Analyzing trace with hash -842088634, now seen corresponding path program 1 times [2018-01-28 22:20:57,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:20:57,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:20:57,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:57,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:20:57,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:20:57,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:20:58,098 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:20:58,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:20:58,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:20:58,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:20:58,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:20:58,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:20:58,100 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 9 states. [2018-01-28 22:20:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:20:58,427 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-01-28 22:20:58,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:20:58,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-28 22:20:58,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:20:58,430 INFO L225 Difference]: With dead ends: 177 [2018-01-28 22:20:58,430 INFO L226 Difference]: Without dead ends: 102 [2018-01-28 22:20:58,431 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:20:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-28 22:20:58,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-01-28 22:20:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 22:20:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-01-28 22:20:58,449 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 25 [2018-01-28 22:20:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:20:58,449 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-01-28 22:20:58,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:20:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-01-28 22:20:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:20:58,451 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:20:58,451 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:20:58,451 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:20:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash -842088635, now seen corresponding path program 1 times [2018-01-28 22:20:58,452 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:20:58,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:20:58,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:58,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:20:58,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:20:58,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:20:58,524 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:20:58,524 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:20:58,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:20:58,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:20:58,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:20:58,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:20:58,525 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 6 states. [2018-01-28 22:20:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:20:58,648 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-01-28 22:20:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:20:58,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-28 22:20:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:20:58,650 INFO L225 Difference]: With dead ends: 99 [2018-01-28 22:20:58,651 INFO L226 Difference]: Without dead ends: 98 [2018-01-28 22:20:58,651 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:20:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-28 22:20:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-28 22:20:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 22:20:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-28 22:20:58,660 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 25 [2018-01-28 22:20:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:20:58,661 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-28 22:20:58,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:20:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-28 22:20:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 22:20:58,662 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:20:58,662 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:20:58,662 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:20:58,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1945442076, now seen corresponding path program 1 times [2018-01-28 22:20:58,663 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:20:58,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:20:58,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:58,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:20:58,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:20:58,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:20:59,016 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:20:59,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:20:59,017 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:20:59,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:20:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:20:59,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:20:59,116 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:20:59,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:20:59,138 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:20:59,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:20:59,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:20:59,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:20:59,486 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:20:59,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:20:59,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-28 22:20:59,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 22:20:59,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 22:20:59,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:20:59,508 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 20 states. [2018-01-28 22:20:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:20:59,926 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-01-28 22:20:59,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:20:59,926 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-28 22:20:59,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:20:59,927 INFO L225 Difference]: With dead ends: 181 [2018-01-28 22:20:59,927 INFO L226 Difference]: Without dead ends: 106 [2018-01-28 22:20:59,928 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:20:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-28 22:20:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-01-28 22:20:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-28 22:20:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2018-01-28 22:20:59,939 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 31 [2018-01-28 22:20:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:20:59,940 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2018-01-28 22:20:59,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 22:20:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-01-28 22:20:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 22:20:59,941 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:20:59,941 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:20:59,942 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:20:59,942 INFO L82 PathProgramCache]: Analyzing trace with hash -600590734, now seen corresponding path program 2 times [2018-01-28 22:20:59,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:20:59,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:20:59,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:59,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:20:59,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:20:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:20:59,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:00,288 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:21:00,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:21:00,290 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:21:00,300 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:21:00,314 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:21:00,319 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:21:00,320 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:21:00,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:21:00,340 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:21:00,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:00,353 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:21:00,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:00,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:21:00,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:21:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:21:00,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:21:00,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-01-28 22:21:00,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 22:21:00,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 22:21:00,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-01-28 22:21:00,751 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 26 states. [2018-01-28 22:21:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:01,718 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2018-01-28 22:21:01,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 22:21:01,718 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-01-28 22:21:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:01,719 INFO L225 Difference]: With dead ends: 186 [2018-01-28 22:21:01,719 INFO L226 Difference]: Without dead ends: 111 [2018-01-28 22:21:01,720 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 22:21:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-28 22:21:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-01-28 22:21:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-28 22:21:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-01-28 22:21:01,729 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 37 [2018-01-28 22:21:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:01,730 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-01-28 22:21:01,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 22:21:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-01-28 22:21:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 22:21:01,731 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:01,732 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:21:01,732 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1544818454, now seen corresponding path program 1 times [2018-01-28 22:21:01,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:01,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:01,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:01,733 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:21:01,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:01,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-28 22:21:01,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:21:01,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:21:01,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:21:01,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:21:01,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:21:01,806 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 5 states. [2018-01-28 22:21:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:01,897 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2018-01-28 22:21:01,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:21:01,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-01-28 22:21:01,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:01,899 INFO L225 Difference]: With dead ends: 134 [2018-01-28 22:21:01,899 INFO L226 Difference]: Without dead ends: 133 [2018-01-28 22:21:01,900 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:21:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-28 22:21:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2018-01-28 22:21:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 22:21:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-01-28 22:21:01,909 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 54 [2018-01-28 22:21:01,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:01,909 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-01-28 22:21:01,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:21:01,910 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-01-28 22:21:01,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 22:21:01,911 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:01,911 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:21:01,911 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:01,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1544818453, now seen corresponding path program 1 times [2018-01-28 22:21:01,912 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:01,912 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:01,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:01,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:01,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:01,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:21:02,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:21:02,026 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:21:02,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:02,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:21:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:21:02,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:21:02,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-28 22:21:02,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 22:21:02,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 22:21:02,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:21:02,219 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 17 states. [2018-01-28 22:21:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:02,397 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2018-01-28 22:21:02,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:21:02,398 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-01-28 22:21:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:02,399 INFO L225 Difference]: With dead ends: 199 [2018-01-28 22:21:02,399 INFO L226 Difference]: Without dead ends: 121 [2018-01-28 22:21:02,400 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-01-28 22:21:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-28 22:21:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-01-28 22:21:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-28 22:21:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-28 22:21:02,410 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 54 [2018-01-28 22:21:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:02,411 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-28 22:21:02,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 22:21:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-28 22:21:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 22:21:02,413 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:02,413 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] [2018-01-28 22:21:02,413 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:02,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1982886101, now seen corresponding path program 2 times [2018-01-28 22:21:02,413 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:02,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:02,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:02,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:02,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:02,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:02,519 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:21:02,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:21:02,520 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:21:02,526 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:21:02,538 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:21:02,540 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:21:02,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:21:02,580 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:21:02,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:21:02,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2018-01-28 22:21:02,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 22:21:02,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 22:21:02,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:21:02,603 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 15 states. [2018-01-28 22:21:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:02,863 INFO L93 Difference]: Finished difference Result 232 states and 253 transitions. [2018-01-28 22:21:02,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 22:21:02,863 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-01-28 22:21:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:02,864 INFO L225 Difference]: With dead ends: 232 [2018-01-28 22:21:02,864 INFO L226 Difference]: Without dead ends: 154 [2018-01-28 22:21:02,865 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:21:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-28 22:21:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2018-01-28 22:21:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-28 22:21:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-01-28 22:21:02,872 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 60 [2018-01-28 22:21:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:02,873 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-01-28 22:21:02,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 22:21:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-01-28 22:21:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-28 22:21:02,874 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:02,874 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 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:21:02,874 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:02,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1687986405, now seen corresponding path program 1 times [2018-01-28 22:21:02,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:02,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:02,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:02,875 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:21:02,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:02,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-01-28 22:21:02,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:21:02,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:21:02,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:21:02,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:21:02,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:21:02,958 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 5 states. [2018-01-28 22:21:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:03,003 INFO L93 Difference]: Finished difference Result 216 states and 232 transitions. [2018-01-28 22:21:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:21:03,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-01-28 22:21:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:03,005 INFO L225 Difference]: With dead ends: 216 [2018-01-28 22:21:03,005 INFO L226 Difference]: Without dead ends: 144 [2018-01-28 22:21:03,006 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:21:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-28 22:21:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 129. [2018-01-28 22:21:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-28 22:21:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-01-28 22:21:03,013 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 74 [2018-01-28 22:21:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:03,014 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-01-28 22:21:03,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:21:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-01-28 22:21:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-28 22:21:03,015 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:03,016 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 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:21:03,016 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1026474647, now seen corresponding path program 1 times [2018-01-28 22:21:03,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:03,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:03,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:03,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:03,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:03,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:21:03,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:21:03,249 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:21:03,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:03,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:21:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:21:03,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:21:03,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-01-28 22:21:03,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 22:21:03,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 22:21:03,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:21:03,474 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 25 states. [2018-01-28 22:21:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:03,659 INFO L93 Difference]: Finished difference Result 221 states and 236 transitions. [2018-01-28 22:21:03,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 22:21:03,660 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-01-28 22:21:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:03,661 INFO L225 Difference]: With dead ends: 221 [2018-01-28 22:21:03,661 INFO L226 Difference]: Without dead ends: 138 [2018-01-28 22:21:03,662 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=830, Unknown=0, NotChecked=0, Total=1190 [2018-01-28 22:21:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-28 22:21:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-01-28 22:21:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-28 22:21:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-01-28 22:21:03,670 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 75 [2018-01-28 22:21:03,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:03,671 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-01-28 22:21:03,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 22:21:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-01-28 22:21:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 22:21:03,671 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:03,672 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:21:03,672 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:03,672 INFO L82 PathProgramCache]: Analyzing trace with hash 283030463, now seen corresponding path program 2 times [2018-01-28 22:21:03,672 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:03,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:03,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:03,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:03,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:03,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:03,917 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:21:03,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:21:03,918 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:21:03,926 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:21:03,938 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:21:03,949 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:21:03,951 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:21:03,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:21:04,098 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:21:04,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:21:04,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-28 22:21:04,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 22:21:04,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 22:21:04,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:21:04,120 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 29 states. [2018-01-28 22:21:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:04,310 INFO L93 Difference]: Finished difference Result 227 states and 242 transitions. [2018-01-28 22:21:04,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 22:21:04,311 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-28 22:21:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:04,312 INFO L225 Difference]: With dead ends: 227 [2018-01-28 22:21:04,312 INFO L226 Difference]: Without dead ends: 144 [2018-01-28 22:21:04,313 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:21:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-28 22:21:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-01-28 22:21:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-28 22:21:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-01-28 22:21:04,320 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 81 [2018-01-28 22:21:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:04,321 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-01-28 22:21:04,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 22:21:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-01-28 22:21:04,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-28 22:21:04,321 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:04,322 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:21:04,322 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash -975990379, now seen corresponding path program 3 times [2018-01-28 22:21:04,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:04,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:04,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:04,323 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:21:04,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:04,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:04,521 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:21:04,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:21:04,521 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:21:04,526 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:21:04,538 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:21:04,543 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:21:04,545 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:21:04,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:21:04,553 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:21:04,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:04,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:21:04,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:21:04,633 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:21:04,639 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:21:04,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:04,642 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:21:04,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-28 22:21:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 3 not checked. [2018-01-28 22:21:04,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:21:04,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 26 [2018-01-28 22:21:04,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 22:21:04,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 22:21:04,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=503, Unknown=1, NotChecked=46, Total=650 [2018-01-28 22:21:04,683 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 26 states. [2018-01-28 22:21:05,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:05,452 INFO L93 Difference]: Finished difference Result 272 states and 298 transitions. [2018-01-28 22:21:05,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-28 22:21:05,452 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-01-28 22:21:05,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:05,454 INFO L225 Difference]: With dead ends: 272 [2018-01-28 22:21:05,454 INFO L226 Difference]: Without dead ends: 189 [2018-01-28 22:21:05,455 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=589, Invalid=2493, Unknown=2, NotChecked=108, Total=3192 [2018-01-28 22:21:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-28 22:21:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 156. [2018-01-28 22:21:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-28 22:21:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2018-01-28 22:21:05,466 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 87 [2018-01-28 22:21:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:05,466 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2018-01-28 22:21:05,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 22:21:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2018-01-28 22:21:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-28 22:21:05,467 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:05,467 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:21:05,467 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash -312199444, now seen corresponding path program 1 times [2018-01-28 22:21:05,467 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:05,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:05,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:05,468 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:21:05,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:05,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:05,668 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:21:05,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:21:05,669 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:21:05,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:05,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:21:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 8 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:21:05,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:21:05,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-01-28 22:21:05,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-28 22:21:05,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-28 22:21:05,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 22:21:05,941 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 37 states. [2018-01-28 22:21:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:06,302 INFO L93 Difference]: Finished difference Result 257 states and 280 transitions. [2018-01-28 22:21:06,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 22:21:06,303 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 93 [2018-01-28 22:21:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:06,305 INFO L225 Difference]: With dead ends: 257 [2018-01-28 22:21:06,305 INFO L226 Difference]: Without dead ends: 165 [2018-01-28 22:21:06,306 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=786, Invalid=1970, Unknown=0, NotChecked=0, Total=2756 [2018-01-28 22:21:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-28 22:21:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-01-28 22:21:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-28 22:21:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2018-01-28 22:21:06,319 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 93 [2018-01-28 22:21:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:06,319 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2018-01-28 22:21:06,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-28 22:21:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2018-01-28 22:21:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-28 22:21:06,321 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:06,321 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:21:06,321 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:06,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1383924674, now seen corresponding path program 2 times [2018-01-28 22:21:06,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:06,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:06,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:06,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:06,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:06,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:06,697 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:21:06,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:21:06,697 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:21:06,703 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:21:06,714 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:21:06,726 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:21:06,729 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:21:06,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:21:06,964 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:21:06,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:21:06,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-28 22:21:06,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-28 22:21:06,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-28 22:21:06,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 22:21:06,985 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand 41 states. [2018-01-28 22:21:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:07,362 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2018-01-28 22:21:07,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 22:21:07,419 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-28 22:21:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:07,420 INFO L225 Difference]: With dead ends: 263 [2018-01-28 22:21:07,420 INFO L226 Difference]: Without dead ends: 171 [2018-01-28 22:21:07,421 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:21:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-28 22:21:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-01-28 22:21:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-28 22:21:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-01-28 22:21:07,433 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 99 [2018-01-28 22:21:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:07,434 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-01-28 22:21:07,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-28 22:21:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-01-28 22:21:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-28 22:21:07,435 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:07,435 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:21:07,435 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:07,436 INFO L82 PathProgramCache]: Analyzing trace with hash 893540376, now seen corresponding path program 3 times [2018-01-28 22:21:07,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:07,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:07,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:07,437 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:21:07,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:07,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:08,076 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:21:08,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:21:08,076 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:21:08,082 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:21:08,094 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:21:08,099 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:21:08,101 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:21:08,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:21:08,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 23 treesize of output 22 [2018-01-28 22:21:08,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:08,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-28 22:21:08,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:08,164 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:21:08,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:08,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-28 22:21:08,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:08,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:21:08,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:21:08,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:21:08,463 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 35 treesize of output 38 [2018-01-28 22:21:08,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:08,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:21:08,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:21:08,508 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 34 treesize of output 28 [2018-01-28 22:21:08,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:08,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:21:08,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:21:08,536 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 37 treesize of output 50 [2018-01-28 22:21:08,537 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:08,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:21:08,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:21:08,566 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 36 treesize of output 30 [2018-01-28 22:21:08,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:21:08,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:21:08,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-28 22:21:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-28 22:21:08,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:21:08,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 35 [2018-01-28 22:21:08,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-28 22:21:08,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-28 22:21:08,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1158, Unknown=1, NotChecked=0, Total=1260 [2018-01-28 22:21:08,713 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 36 states. [2018-01-28 22:21:09,086 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-28 22:21:34,611 WARN L143 SmtUtils]: Spent 14241ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-28 22:21:56,864 WARN L146 SmtUtils]: Spent 22185ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-01-28 22:21:57,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:57,355 INFO L93 Difference]: Finished difference Result 276 states and 304 transitions. [2018-01-28 22:21:57,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-28 22:21:57,355 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 105 [2018-01-28 22:21:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:57,357 INFO L225 Difference]: With dead ends: 276 [2018-01-28 22:21:57,357 INFO L226 Difference]: Without dead ends: 274 [2018-01-28 22:21:57,358 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=516, Invalid=3770, Unknown=4, NotChecked=0, Total=4290 [2018-01-28 22:21:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-28 22:21:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 172. [2018-01-28 22:21:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-28 22:21:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-01-28 22:21:57,374 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 105 [2018-01-28 22:21:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:57,374 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-01-28 22:21:57,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-28 22:21:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-01-28 22:21:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-28 22:21:57,375 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:57,375 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:21:57,376 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1266036338, now seen corresponding path program 1 times [2018-01-28 22:21:57,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:57,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:57,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:57,377 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:21:57,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:57,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:57,442 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:21:57,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:21:57,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:21:57,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:21:57,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:21:57,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:21:57,443 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 4 states. [2018-01-28 22:21:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:57,582 INFO L93 Difference]: Finished difference Result 230 states and 248 transitions. [2018-01-28 22:21:57,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:21:57,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-01-28 22:21:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:57,584 INFO L225 Difference]: With dead ends: 230 [2018-01-28 22:21:57,584 INFO L226 Difference]: Without dead ends: 183 [2018-01-28 22:21:57,584 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:21:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-28 22:21:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2018-01-28 22:21:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-28 22:21:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2018-01-28 22:21:57,601 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 107 [2018-01-28 22:21:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:57,602 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2018-01-28 22:21:57,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:21:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2018-01-28 22:21:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-28 22:21:57,603 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:57,603 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] [2018-01-28 22:21:57,603 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1171291026, now seen corresponding path program 1 times [2018-01-28 22:21:57,603 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:57,603 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:57,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:57,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:57,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:57,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-28 22:21:58,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:21:58,229 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:21:58,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:58,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:21:58,611 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:21:58,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:21:58,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 20 [2018-01-28 22:21:58,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 22:21:58,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 22:21:58,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:21:58,645 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand 20 states. [2018-01-28 22:21:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:59,318 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2018-01-28 22:21:59,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 22:21:59,319 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 114 [2018-01-28 22:21:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:59,321 INFO L225 Difference]: With dead ends: 277 [2018-01-28 22:21:59,321 INFO L226 Difference]: Without dead ends: 220 [2018-01-28 22:21:59,322 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-01-28 22:21:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-28 22:21:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 183. [2018-01-28 22:21:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-28 22:21:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2018-01-28 22:21:59,348 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 114 [2018-01-28 22:21:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:59,348 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2018-01-28 22:21:59,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 22:21:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2018-01-28 22:21:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-28 22:21:59,350 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:59,350 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, 1, 1, 1, 1] [2018-01-28 22:21:59,350 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:59,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1072528742, now seen corresponding path program 1 times [2018-01-28 22:21:59,350 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:59,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:59,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:59,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:59,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:59,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:21:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-01-28 22:21:59,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:21:59,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:21:59,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:21:59,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:21:59,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:21:59,448 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand 6 states. [2018-01-28 22:21:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:21:59,643 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2018-01-28 22:21:59,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:21:59,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-01-28 22:21:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:21:59,645 INFO L225 Difference]: With dead ends: 213 [2018-01-28 22:21:59,645 INFO L226 Difference]: Without dead ends: 212 [2018-01-28 22:21:59,646 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:21:59,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-28 22:21:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 201. [2018-01-28 22:21:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-01-28 22:21:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2018-01-28 22:21:59,676 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 119 [2018-01-28 22:21:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:21:59,677 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2018-01-28 22:21:59,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:21:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2018-01-28 22:21:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-28 22:21:59,678 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:21:59,678 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, 1, 1, 1, 1] [2018-01-28 22:21:59,678 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:21:59,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1072528741, now seen corresponding path program 1 times [2018-01-28 22:21:59,678 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:21:59,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:21:59,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:59,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:21:59,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:21:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:21:59,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:22:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 1 proven. 126 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-28 22:22:00,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:22:00,301 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:22:00,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:22:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:22:00,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:22:00,346 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 14 treesize of output 13 [2018-01-28 22:22:00,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:00,357 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:22:00,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:00,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:22:00,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-28 22:22:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 211 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:22:04,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:22:04,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 47 [2018-01-28 22:22:04,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-28 22:22:04,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-28 22:22:04,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2051, Unknown=1, NotChecked=0, Total=2256 [2018-01-28 22:22:04,669 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand 48 states. [2018-01-28 22:22:06,944 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-28 22:22:11,081 WARN L143 SmtUtils]: Spent 4012ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-28 22:22:14,947 WARN L143 SmtUtils]: Spent 3817ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-28 22:22:17,427 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 60 DAG size of output 42 [2018-01-28 22:22:26,088 WARN L146 SmtUtils]: Spent 4086ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-01-28 22:22:28,972 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 45 DAG size of output 44 [2018-01-28 22:22:29,134 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-01-28 22:22:31,530 WARN L146 SmtUtils]: Spent 2341ms on a formula simplification. DAG size of input: 54 DAG size of output 50 [2018-01-28 22:22:32,116 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-01-28 22:22:36,720 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 54 DAG size of output 50 [2018-01-28 22:22:36,901 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 45 DAG size of output 44 [2018-01-28 22:22:37,435 WARN L146 SmtUtils]: Spent 456ms on a formula simplification. DAG size of input: 45 DAG size of output 44 [2018-01-28 22:22:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:22:49,774 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2018-01-28 22:22:49,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-28 22:22:49,775 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 119 [2018-01-28 22:22:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:22:49,776 INFO L225 Difference]: With dead ends: 227 [2018-01-28 22:22:49,776 INFO L226 Difference]: Without dead ends: 226 [2018-01-28 22:22:49,778 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=1194, Invalid=7546, Unknown=2, NotChecked=0, Total=8742 [2018-01-28 22:22:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-28 22:22:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211. [2018-01-28 22:22:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-28 22:22:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 231 transitions. [2018-01-28 22:22:49,799 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 231 transitions. Word has length 119 [2018-01-28 22:22:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:22:49,800 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 231 transitions. [2018-01-28 22:22:49,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-28 22:22:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 231 transitions. [2018-01-28 22:22:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-28 22:22:49,800 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:22:49,801 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, 1, 1, 1, 1] [2018-01-28 22:22:49,801 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:22:49,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1805836304, now seen corresponding path program 1 times [2018-01-28 22:22:49,801 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:22:49,801 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:22:49,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:22:49,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:22:49,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:22:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:22:49,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:22:49,902 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:22:49,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:22:49,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:22:49,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:22:49,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:22:49,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:22:49,903 INFO L87 Difference]: Start difference. First operand 211 states and 231 transitions. Second operand 6 states. [2018-01-28 22:22:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:22:50,063 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2018-01-28 22:22:50,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:22:50,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-01-28 22:22:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:22:50,065 INFO L225 Difference]: With dead ends: 290 [2018-01-28 22:22:50,065 INFO L226 Difference]: Without dead ends: 230 [2018-01-28 22:22:50,065 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:22:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-28 22:22:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 208. [2018-01-28 22:22:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-28 22:22:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-01-28 22:22:50,085 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 120 [2018-01-28 22:22:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:22:50,085 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-01-28 22:22:50,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:22:50,085 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-01-28 22:22:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-28 22:22:50,086 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:22:50,086 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, 1, 1, 1, 1, 1] [2018-01-28 22:22:50,086 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-28 22:22:50,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1111347431, now seen corresponding path program 1 times [2018-01-28 22:22:50,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:22:50,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:22:50,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:22:50,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:22:50,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:22:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:22:50,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:22:51,108 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 30 DAG size of output 26 [2018-01-28 22:22:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 90 proven. 204 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-28 22:22:52,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:22:52,525 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:22:52,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:22:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:22:52,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:22:52,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 22:22:52,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:22:52,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:52,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:52,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:52,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-01-28 22:22:52,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-28 22:22:52,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:52,805 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 18 treesize of output 27 [2018-01-28 22:22:52,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:52,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:52,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:52,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-28 22:22:52,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-01-28 22:22:52,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:52,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:52,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:52,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-01-28 22:22:52,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:52,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:52,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:52,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-28 22:22:53,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-01-28 22:22:53,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-01-28 22:22:53,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:53,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:53,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:22:53,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-01-28 22:22:53,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-01-28 22:22:53,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 146 [2018-01-28 22:22:53,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:53,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:53,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:22:53,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-01-28 22:22:53,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2018-01-28 22:22:53,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:53,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 211 [2018-01-28 22:22:53,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:53,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:53,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 22:22:53,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:82 [2018-01-28 22:22:54,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-01-28 22:22:54,011 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:54,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 288 [2018-01-28 22:22:54,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:54,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:54,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-28 22:22:54,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-01-28 22:22:55,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 70 [2018-01-28 22:22:55,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:55,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 377 [2018-01-28 22:22:55,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:55,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:55,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-28 22:22:55,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:118, output treesize:114 [2018-01-28 22:22:59,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 79 [2018-01-28 22:22:59,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,092 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,093 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:22:59,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 478 [2018-01-28 22:22:59,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:22:59,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:22:59,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-28 22:22:59,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:134, output treesize:130 Received shutdown request... [2018-01-28 22:23:22,867 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-28 22:23:22,868 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:23:22,872 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:23:22,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:23:22 BoogieIcfgContainer [2018-01-28 22:23:22,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:23:22,873 INFO L168 Benchmark]: Toolchain (without parser) took 146835.20 ms. Allocated memory was 296.7 MB in the beginning and 656.9 MB in the end (delta: 360.2 MB). Free memory was 255.8 MB in the beginning and 403.4 MB in the end (delta: -147.6 MB). Peak memory consumption was 212.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:23:22,874 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 296.7 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:23:22,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.20 ms. Allocated memory is still 296.7 MB. Free memory was 255.8 MB in the beginning and 241.8 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:23:22,875 INFO L168 Benchmark]: Boogie Preprocessor took 48.31 ms. Allocated memory is still 296.7 MB. Free memory was 241.8 MB in the beginning and 240.8 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-01-28 22:23:22,875 INFO L168 Benchmark]: RCFGBuilder took 389.59 ms. Allocated memory is still 296.7 MB. Free memory was 240.8 MB in the beginning and 216.1 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-01-28 22:23:22,876 INFO L168 Benchmark]: TraceAbstraction took 146157.51 ms. Allocated memory was 296.7 MB in the beginning and 656.9 MB in the end (delta: 360.2 MB). Free memory was 216.1 MB in the beginning and 403.4 MB in the end (delta: -187.3 MB). Peak memory consumption was 172.9 MB. Max. memory is 5.3 GB. [2018-01-28 22:23:22,878 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.13 ms. Allocated memory is still 296.7 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 231.20 ms. Allocated memory is still 296.7 MB. Free memory was 255.8 MB in the beginning and 241.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.31 ms. Allocated memory is still 296.7 MB. Free memory was 241.8 MB in the beginning and 240.8 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 389.59 ms. Allocated memory is still 296.7 MB. Free memory was 240.8 MB in the beginning and 216.1 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 146157.51 ms. Allocated memory was 296.7 MB in the beginning and 656.9 MB in the end (delta: 360.2 MB). Free memory was 216.1 MB in the beginning and 403.4 MB in the end (delta: -187.3 MB). Peak memory consumption was 172.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 97 locations, 15 error locations. TIMEOUT Result, 146.1s OverallTime, 23 OverallIterations, 11 TraceHistogramMax, 99.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2055 SDtfs, 2377 SDslu, 16424 SDs, 0 SdLazy, 6747 SolverSat, 423 SolverUnsat, 37 SolverUnknown, 0 SolverNotchecked, 34.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1444 GetRequests, 847 SyntacticMatches, 4 SemanticMatches, 593 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7314 ImplicationChecksByTransitivity, 73.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=21, 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.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 384 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 2505 NumberOfCodeBlocks, 2379 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2471 ConstructedInterpolants, 104 QuantifiedInterpolants, 1484198 SizeOfPredicates, 139 NumberOfNonLiveVariables, 2247 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 34 InterpolantComputations, 11 PerfectInterpolantSequences, 2653/4479 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_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-23-22-887.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-23-22-887.csv Completed graceful shutdown