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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:45:12,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:45:12,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:45:12,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:45:12,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:45:12,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:45:12,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:45:12,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:45:12,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:45:12,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:45:12,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:45:12,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:45:12,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:45:12,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:45:12,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:45:12,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:45:12,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:45:12,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:45:12,241 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:45:12,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:45:12,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:45:12,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:45:12,245 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:45:12,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:45:12,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:45:12,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:45:12,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:45:12,251 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:45:12,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:45:12,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:45:12,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:45:12,253 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-31 08:45:12,263 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:45:12,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:45:12,264 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:45:12,264 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:45:12,265 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:45:12,265 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:45:12,265 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:45:12,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:45:12,266 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:45:12,266 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:45:12,266 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:45:12,266 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:45:12,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:45:12,267 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:45:12,267 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:45:12,267 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:45:12,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:45:12,267 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:45:12,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:45:12,268 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:45:12,268 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:45:12,268 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:45:12,268 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:45:12,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:45:12,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:45:12,269 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:45:12,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:45:12,269 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:45:12,270 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:45:12,270 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:45:12,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:45:12,270 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:45:12,271 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:45:12,271 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:45:12,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:45:12,336 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:45:12,340 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:45:12,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:45:12,342 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:45:12,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-31 08:45:12,569 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:45:12,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:45:12,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:45:12,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:45:12,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:45:12,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:45:12" (1/1) ... [2018-01-31 08:45:12,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c884762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12, skipping insertion in model container [2018-01-31 08:45:12,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:45:12" (1/1) ... [2018-01-31 08:45:12,612 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:45:12,692 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:45:12,890 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:45:12,913 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:45:12,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12 WrapperNode [2018-01-31 08:45:12,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:45:12,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:45:12,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:45:12,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:45:12,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12" (1/1) ... [2018-01-31 08:45:12,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12" (1/1) ... [2018-01-31 08:45:12,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12" (1/1) ... [2018-01-31 08:45:12,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12" (1/1) ... [2018-01-31 08:45:12,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12" (1/1) ... [2018-01-31 08:45:12,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12" (1/1) ... [2018-01-31 08:45:12,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12" (1/1) ... [2018-01-31 08:45:12,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:45:12,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:45:12,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:45:12,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:45:12,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12" (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-31 08:45:13,043 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:45:13,043 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:45:13,043 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-01-31 08:45:13,044 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:45:13,044 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-31 08:45:13,044 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-31 08:45:13,044 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:45:13,044 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:45:13,044 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:45:13,044 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:45:13,045 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:45:13,045 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:45:13,045 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:45:13,045 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:45:13,045 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:45:13,045 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:45:13,046 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-01-31 08:45:13,046 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:45:13,046 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-31 08:45:13,046 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-31 08:45:13,046 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-31 08:45:13,046 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:45:13,046 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:45:13,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:45:13,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:45:13,686 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:45:13,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:45:13 BoogieIcfgContainer [2018-01-31 08:45:13,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:45:13,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:45:13,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:45:13,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:45:13,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:45:12" (1/3) ... [2018-01-31 08:45:13,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321ac2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:45:13, skipping insertion in model container [2018-01-31 08:45:13,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:45:12" (2/3) ... [2018-01-31 08:45:13,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321ac2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:45:13, skipping insertion in model container [2018-01-31 08:45:13,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:45:13" (3/3) ... [2018-01-31 08:45:13,695 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-31 08:45:13,704 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:45:13,712 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-31 08:45:13,763 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:45:13,763 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:45:13,763 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:45:13,763 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:45:13,763 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:45:13,764 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:45:13,764 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:45:13,764 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:45:13,765 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:45:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-01-31 08:45:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:45:13,793 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:13,795 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:45:13,795 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash 807914669, now seen corresponding path program 1 times [2018-01-31 08:45:13,802 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:13,803 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:13,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:13,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:13,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:13,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:14,135 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-31 08:45:14,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:45:14,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:45:14,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:45:14,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:45:14,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:45:14,301 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 3 states. [2018-01-31 08:45:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:45:14,923 INFO L93 Difference]: Finished difference Result 251 states and 292 transitions. [2018-01-31 08:45:14,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:45:14,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-31 08:45:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:45:14,938 INFO L225 Difference]: With dead ends: 251 [2018-01-31 08:45:14,939 INFO L226 Difference]: Without dead ends: 166 [2018-01-31 08:45:14,942 INFO L554 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-31 08:45:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-31 08:45:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 115. [2018-01-31 08:45:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-31 08:45:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-31 08:45:14,994 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 34 [2018-01-31 08:45:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:45:14,994 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-31 08:45:14,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:45:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-31 08:45:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:45:14,996 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:14,996 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:45:14,997 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1388598547, now seen corresponding path program 1 times [2018-01-31 08:45:14,997 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:14,998 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:14,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:14,999 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:14,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:15,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:15,142 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-31 08:45:15,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:45:15,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:45:15,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:45:15,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:45:15,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:45:15,145 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 6 states. [2018-01-31 08:45:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:45:15,241 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2018-01-31 08:45:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:45:15,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-31 08:45:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:45:15,247 INFO L225 Difference]: With dead ends: 136 [2018-01-31 08:45:15,247 INFO L226 Difference]: Without dead ends: 132 [2018-01-31 08:45:15,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:45:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-31 08:45:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 110. [2018-01-31 08:45:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-31 08:45:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-01-31 08:45:15,262 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 35 [2018-01-31 08:45:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:45:15,263 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-01-31 08:45:15,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:45:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-01-31 08:45:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:45:15,264 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:15,264 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:45:15,264 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash -752147610, now seen corresponding path program 1 times [2018-01-31 08:45:15,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:15,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:15,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:15,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:15,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:15,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:15,366 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-31 08:45:15,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:45:15,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:45:15,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:45:15,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:45:15,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:45:15,368 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 5 states. [2018-01-31 08:45:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:45:15,462 INFO L93 Difference]: Finished difference Result 200 states and 213 transitions. [2018-01-31 08:45:15,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:45:15,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-31 08:45:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:45:15,464 INFO L225 Difference]: With dead ends: 200 [2018-01-31 08:45:15,464 INFO L226 Difference]: Without dead ends: 112 [2018-01-31 08:45:15,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:45:15,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-31 08:45:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-31 08:45:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:45:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-31 08:45:15,479 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 35 [2018-01-31 08:45:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:45:15,479 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-31 08:45:15,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:45:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-31 08:45:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:45:15,480 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:15,480 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:45:15,480 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:15,481 INFO L82 PathProgramCache]: Analyzing trace with hash -124580570, now seen corresponding path program 1 times [2018-01-31 08:45:15,481 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:15,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:15,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:15,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:15,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:15,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:15,592 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-31 08:45:15,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:45:15,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:45:15,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:45:15,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:45:15,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:45:15,594 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 6 states. [2018-01-31 08:45:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:45:16,082 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-01-31 08:45:16,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:45:16,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-31 08:45:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:45:16,085 INFO L225 Difference]: With dead ends: 112 [2018-01-31 08:45:16,085 INFO L226 Difference]: Without dead ends: 111 [2018-01-31 08:45:16,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:45:16,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-31 08:45:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-31 08:45:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:45:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-01-31 08:45:16,103 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 36 [2018-01-31 08:45:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:45:16,103 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-01-31 08:45:16,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:45:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-01-31 08:45:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:45:16,105 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:16,105 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:45:16,105 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -124580569, now seen corresponding path program 1 times [2018-01-31 08:45:16,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:16,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:16,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:16,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:16,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:16,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:17,052 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-31 08:45:17,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:45:17,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-31 08:45:17,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:45:17,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:45:17,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:45:17,054 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 13 states. [2018-01-31 08:45:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:45:17,714 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-01-31 08:45:17,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:45:17,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-01-31 08:45:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:45:17,716 INFO L225 Difference]: With dead ends: 197 [2018-01-31 08:45:17,716 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:45:17,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:45:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:45:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-01-31 08:45:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-31 08:45:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-01-31 08:45:17,728 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 36 [2018-01-31 08:45:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:45:17,728 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-01-31 08:45:17,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:45:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-01-31 08:45:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 08:45:17,730 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:17,730 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:45:17,730 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1474274973, now seen corresponding path program 1 times [2018-01-31 08:45:17,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:17,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:17,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:17,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:17,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:17,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:18,113 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-31 08:45:18,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:45:18,114 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-31 08:45:18,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:18,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:45:18,293 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-31 08:45:18,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:18,321 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-31 08:45:18,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:18,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:45:18,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:45:19,127 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-31 08:45:19,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:45:19,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-01-31 08:45:19,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:45:19,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:45:19,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:45:19,161 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 23 states. [2018-01-31 08:45:20,105 WARN L146 SmtUtils]: Spent 328ms on a formula simplification. DAG size of input: 27 DAG size of output 25 [2018-01-31 08:45:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:45:20,314 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-31 08:45:20,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:45:20,315 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-01-31 08:45:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:45:20,316 INFO L225 Difference]: With dead ends: 117 [2018-01-31 08:45:20,316 INFO L226 Difference]: Without dead ends: 116 [2018-01-31 08:45:20,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:45:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-31 08:45:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-31 08:45:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:45:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-31 08:45:20,326 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 42 [2018-01-31 08:45:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:45:20,326 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-31 08:45:20,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:45:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-31 08:45:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:45:20,331 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:20,332 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:45:20,332 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1536057818, now seen corresponding path program 1 times [2018-01-31 08:45:20,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:20,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:20,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:20,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:20,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:20,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:45:20,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:45:20,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:45:20,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:45:20,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:45:20,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:45:20,455 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 5 states. [2018-01-31 08:45:20,663 WARN L143 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 10 [2018-01-31 08:45:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:45:20,683 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2018-01-31 08:45:20,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:45:20,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-01-31 08:45:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:45:20,685 INFO L225 Difference]: With dead ends: 189 [2018-01-31 08:45:20,685 INFO L226 Difference]: Without dead ends: 117 [2018-01-31 08:45:20,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:45:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-31 08:45:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-01-31 08:45:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-31 08:45:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-01-31 08:45:20,695 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 61 [2018-01-31 08:45:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:45:20,695 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-01-31 08:45:20,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:45:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-01-31 08:45:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:45:20,697 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:20,698 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:45:20,698 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash 429771204, now seen corresponding path program 1 times [2018-01-31 08:45:20,698 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:20,698 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:20,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:20,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:20,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:20,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:45:20,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:45:20,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:45:20,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:45:20,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:45:20,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:45:20,950 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 6 states. [2018-01-31 08:45:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:45:21,243 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2018-01-31 08:45:21,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:45:21,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-01-31 08:45:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:45:21,244 INFO L225 Difference]: With dead ends: 165 [2018-01-31 08:45:21,245 INFO L226 Difference]: Without dead ends: 163 [2018-01-31 08:45:21,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:45:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-31 08:45:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2018-01-31 08:45:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-31 08:45:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2018-01-31 08:45:21,256 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 62 [2018-01-31 08:45:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:45:21,257 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2018-01-31 08:45:21,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:45:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2018-01-31 08:45:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:45:21,258 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:21,259 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:45:21,259 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:21,259 INFO L82 PathProgramCache]: Analyzing trace with hash 429771205, now seen corresponding path program 1 times [2018-01-31 08:45:21,259 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:21,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:21,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:21,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:21,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:21,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:45:21,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:45:21,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:45:21,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:45:21,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:45:21,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:45:21,409 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand 11 states. [2018-01-31 08:45:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:45:21,963 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2018-01-31 08:45:21,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:45:21,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-31 08:45:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:45:21,964 INFO L225 Difference]: With dead ends: 208 [2018-01-31 08:45:21,964 INFO L226 Difference]: Without dead ends: 171 [2018-01-31 08:45:21,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:45:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-31 08:45:21,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2018-01-31 08:45:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-31 08:45:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-01-31 08:45:21,974 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 62 [2018-01-31 08:45:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:45:21,975 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-01-31 08:45:21,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:45:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-01-31 08:45:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:45:21,976 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:21,976 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:45:21,977 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:21,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1731911702, now seen corresponding path program 1 times [2018-01-31 08:45:21,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:21,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:21,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:21,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:21,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:21,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:45:22,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:45:22,529 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-31 08:45:22,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:22,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:45:22,600 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-31 08:45:22,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:22,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:45:22,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:45:22,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:45:22,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:45:22,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-31 08:45:22,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:22,722 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-31 08:45:22,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-31 08:45:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:45:22,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:45:22,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-01-31 08:45:22,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:45:22,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:45:22,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:45:22,766 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 13 states. [2018-01-31 08:45:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:45:23,514 INFO L93 Difference]: Finished difference Result 195 states and 221 transitions. [2018-01-31 08:45:23,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:45:23,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-01-31 08:45:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:45:23,516 INFO L225 Difference]: With dead ends: 195 [2018-01-31 08:45:23,516 INFO L226 Difference]: Without dead ends: 192 [2018-01-31 08:45:23,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:45:23,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-31 08:45:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 149. [2018-01-31 08:45:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-31 08:45:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-01-31 08:45:23,533 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 62 [2018-01-31 08:45:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:45:23,534 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-01-31 08:45:23,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:45:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-01-31 08:45:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:45:23,535 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:45:23,535 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:45:23,535 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:45:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1731911703, now seen corresponding path program 1 times [2018-01-31 08:45:23,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:45:23,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:45:23,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:23,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:23,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:45:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:23,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:45:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:45:24,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:45:24,167 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-31 08:45:24,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:45:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:45:24,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:45:24,217 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-31 08:45:24,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:24,470 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-31 08:45:24,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:24,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-31 08:45:24,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:24,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-31 08:45:24,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:24,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:45:24,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-31 08:45:25,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:45:25,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:45:25,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2018-01-31 08:45:25,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:25,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:45:25,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:45:25,379 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 50 treesize of output 44 [2018-01-31 08:45:25,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:25,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:45:25,412 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 49 treesize of output 52 [2018-01-31 08:45:25,412 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:25,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:45:25,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:45:25,520 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 48 treesize of output 42 [2018-01-31 08:45:25,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:45:25,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-31 08:45:25,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:101, output treesize:83 [2018-01-31 08:45:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:45:25,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:45:25,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-31 08:45:25,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 08:45:25,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 08:45:25,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=543, Unknown=1, NotChecked=0, Total=600 [2018-01-31 08:45:25,962 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 25 states. [2018-01-31 08:45:28,269 WARN L146 SmtUtils]: Spent 2088ms on a formula simplification. DAG size of input: 60 DAG size of output 56 [2018-01-31 08:45:31,151 WARN L146 SmtUtils]: Spent 2714ms on a formula simplification. DAG size of input: 77 DAG size of output 72 [2018-01-31 08:45:31,337 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 53 DAG size of output 52 [2018-01-31 08:45:37,549 WARN L146 SmtUtils]: Spent 6136ms on a formula simplification. DAG size of input: 69 DAG size of output 68 [2018-01-31 08:45:43,566 WARN L146 SmtUtils]: Spent 5986ms on a formula simplification. DAG size of input: 52 DAG size of output 52 [2018-01-31 08:46:18,004 WARN L146 SmtUtils]: Spent 20301ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-01-31 08:46:40,388 WARN L146 SmtUtils]: Spent 22320ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-01-31 08:46:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:41,236 INFO L93 Difference]: Finished difference Result 255 states and 280 transitions. [2018-01-31 08:46:41,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:46:41,237 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-01-31 08:46:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:41,239 INFO L225 Difference]: With dead ends: 255 [2018-01-31 08:46:41,239 INFO L226 Difference]: Without dead ends: 254 [2018-01-31 08:46:41,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 61.9s TimeCoverageRelationStatistics Valid=192, Invalid=1444, Unknown=4, NotChecked=0, Total=1640 [2018-01-31 08:46:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-31 08:46:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 153. [2018-01-31 08:46:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-31 08:46:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2018-01-31 08:46:41,264 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 62 [2018-01-31 08:46:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:41,264 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2018-01-31 08:46:41,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 08:46:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2018-01-31 08:46:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-31 08:46:41,265 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:41,265 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:46:41,265 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2118368878, now seen corresponding path program 1 times [2018-01-31 08:46:41,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:41,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:41,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:41,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:41,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:41,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:46:41,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:41,361 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-31 08:46:41,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:41,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:46:41,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:46:41,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 10 [2018-01-31 08:46:41,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:46:41,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:46:41,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:46:41,428 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 10 states. [2018-01-31 08:46:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:41,759 INFO L93 Difference]: Finished difference Result 276 states and 312 transitions. [2018-01-31 08:46:41,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:46:41,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-01-31 08:46:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:41,761 INFO L225 Difference]: With dead ends: 276 [2018-01-31 08:46:41,761 INFO L226 Difference]: Without dead ends: 228 [2018-01-31 08:46:41,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:46:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-31 08:46:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 204. [2018-01-31 08:46:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-31 08:46:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2018-01-31 08:46:41,801 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 64 [2018-01-31 08:46:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:41,802 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2018-01-31 08:46:41,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:46:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2018-01-31 08:46:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-31 08:46:41,803 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:41,803 INFO L351 BasicCegarLoop]: trace histogram [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, 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-31 08:46:41,803 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:41,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1181630033, now seen corresponding path program 1 times [2018-01-31 08:46:41,804 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:41,804 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:41,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:41,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:41,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:41,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:42,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:42,032 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-31 08:46:42,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:42,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:42,089 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-31 08:46:42,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:42,270 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-31 08:46:42,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:42,433 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-31 08:46:42,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-31 08:46:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:42,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:42,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-31 08:46:42,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:46:42,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:46:42,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:46:42,969 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand 20 states. [2018-01-31 08:46:45,446 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:46:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:56,567 INFO L93 Difference]: Finished difference Result 230 states and 255 transitions. [2018-01-31 08:46:56,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:46:56,602 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 76 [2018-01-31 08:46:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:56,604 INFO L225 Difference]: With dead ends: 230 [2018-01-31 08:46:56,604 INFO L226 Difference]: Without dead ends: 229 [2018-01-31 08:46:56,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2018-01-31 08:46:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-31 08:46:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 214. [2018-01-31 08:46:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-31 08:46:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 243 transitions. [2018-01-31 08:46:56,646 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 243 transitions. Word has length 76 [2018-01-31 08:46:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:56,647 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 243 transitions. [2018-01-31 08:46:56,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:46:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 243 transitions. [2018-01-31 08:46:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-31 08:46:56,648 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:56,648 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:46:56,649 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:56,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1841193406, now seen corresponding path program 1 times [2018-01-31 08:46:56,649 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:56,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:56,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:56,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:56,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:56,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:46:56,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:46:56,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:46:56,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:46:56,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:46:56,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:46:56,789 INFO L87 Difference]: Start difference. First operand 214 states and 243 transitions. Second operand 6 states. [2018-01-31 08:46:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:57,145 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2018-01-31 08:46:57,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:46:57,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-01-31 08:46:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:57,147 INFO L225 Difference]: With dead ends: 282 [2018-01-31 08:46:57,147 INFO L226 Difference]: Without dead ends: 215 [2018-01-31 08:46:57,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:46:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-31 08:46:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-01-31 08:46:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-31 08:46:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2018-01-31 08:46:57,183 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 77 [2018-01-31 08:46:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:57,183 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2018-01-31 08:46:57,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:46:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2018-01-31 08:46:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-31 08:46:57,184 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:57,185 INFO L351 BasicCegarLoop]: trace histogram [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, 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-31 08:46:57,185 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:57,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2024174689, now seen corresponding path program 1 times [2018-01-31 08:46:57,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:57,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:57,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:57,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:57,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:57,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:57,987 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 16 DAG size of output 9 [2018-01-31 08:46:58,466 WARN L146 SmtUtils]: Spent 331ms on a formula simplification. DAG size of input: 26 DAG size of output 15 [2018-01-31 08:46:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:46:58,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:58,624 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-31 08:46:58,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:58,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:58,673 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 11 treesize of output 8 [2018-01-31 08:46:58,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:46:58,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:58,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:58,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:58,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-31 08:46:58,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-31 08:46:58,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-31 08:46:58,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:58,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:58,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:58,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-31 08:46:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:46:58,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:58,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2018-01-31 08:46:58,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:46:58,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:46:58,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:46:58,781 INFO L87 Difference]: Start difference. First operand 211 states and 236 transitions. Second operand 19 states. [2018-01-31 08:46:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:59,385 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2018-01-31 08:46:59,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:46:59,385 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-01-31 08:46:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:59,386 INFO L225 Difference]: With dead ends: 226 [2018-01-31 08:46:59,387 INFO L226 Difference]: Without dead ends: 225 [2018-01-31 08:46:59,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2018-01-31 08:46:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-31 08:46:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 212. [2018-01-31 08:46:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-31 08:46:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 238 transitions. [2018-01-31 08:46:59,420 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 238 transitions. Word has length 77 [2018-01-31 08:46:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:59,421 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 238 transitions. [2018-01-31 08:46:59,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:46:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 238 transitions. [2018-01-31 08:46:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-31 08:46:59,422 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:59,422 INFO L351 BasicCegarLoop]: trace histogram [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, 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-31 08:46:59,423 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:59,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2024174690, now seen corresponding path program 1 times [2018-01-31 08:46:59,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:59,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:59,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:59,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:59,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:59,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:46:59,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:59,669 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-31 08:46:59,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:59,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:59,785 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 11 treesize of output 8 [2018-01-31 08:46:59,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:46:59,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:59,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:59,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:59,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-31 08:46:59,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-31 08:46:59,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-31 08:46:59,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:59,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:59,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:59,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-31 08:46:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:46:59,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:59,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2018-01-31 08:46:59,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:46:59,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:46:59,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:46:59,947 INFO L87 Difference]: Start difference. First operand 212 states and 238 transitions. Second operand 19 states. [2018-01-31 08:47:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:00,773 INFO L93 Difference]: Finished difference Result 225 states and 246 transitions. [2018-01-31 08:47:00,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:47:00,773 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-01-31 08:47:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:00,775 INFO L225 Difference]: With dead ends: 225 [2018-01-31 08:47:00,775 INFO L226 Difference]: Without dead ends: 224 [2018-01-31 08:47:00,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2018-01-31 08:47:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-31 08:47:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2018-01-31 08:47:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-31 08:47:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2018-01-31 08:47:00,805 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 77 [2018-01-31 08:47:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:00,805 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2018-01-31 08:47:00,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:47:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2018-01-31 08:47:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:47:00,807 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:00,807 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:47:00,807 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:00,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1195867586, now seen corresponding path program 1 times [2018-01-31 08:47:00,808 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:00,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:00,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:00,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:00,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:00,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-31 08:47:01,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:01,333 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-31 08:47:01,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:01,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-31 08:47:01,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:47:01,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-31 08:47:01,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:47:01,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:47:01,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:47:01,791 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand 7 states. [2018-01-31 08:47:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:03,318 INFO L93 Difference]: Finished difference Result 238 states and 265 transitions. [2018-01-31 08:47:03,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:47:03,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2018-01-31 08:47:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:03,320 INFO L225 Difference]: With dead ends: 238 [2018-01-31 08:47:03,320 INFO L226 Difference]: Without dead ends: 236 [2018-01-31 08:47:03,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:47:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-31 08:47:03,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2018-01-31 08:47:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-31 08:47:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2018-01-31 08:47:03,358 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 80 [2018-01-31 08:47:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:03,359 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2018-01-31 08:47:03,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:47:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2018-01-31 08:47:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:47:03,360 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:03,360 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:47:03,360 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1195867587, now seen corresponding path program 1 times [2018-01-31 08:47:03,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:03,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:03,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:03,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:03,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:03,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:47:04,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:04,126 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-31 08:47:04,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:04,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:47:04,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:47:04,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 26 [2018-01-31 08:47:04,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:47:04,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:47:04,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:47:04,461 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand 27 states. [2018-01-31 08:47:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:05,519 INFO L93 Difference]: Finished difference Result 320 states and 358 transitions. [2018-01-31 08:47:05,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-31 08:47:05,520 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2018-01-31 08:47:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:05,522 INFO L225 Difference]: With dead ends: 320 [2018-01-31 08:47:05,522 INFO L226 Difference]: Without dead ends: 319 [2018-01-31 08:47:05,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=216, Invalid=1854, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 08:47:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-31 08:47:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 233. [2018-01-31 08:47:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-01-31 08:47:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 262 transitions. [2018-01-31 08:47:05,563 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 262 transitions. Word has length 80 [2018-01-31 08:47:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:05,563 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 262 transitions. [2018-01-31 08:47:05,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:47:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 262 transitions. [2018-01-31 08:47:05,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:47:05,566 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:05,566 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:47:05,567 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:05,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1796959211, now seen corresponding path program 1 times [2018-01-31 08:47:05,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:05,567 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:05,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:05,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:05,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:05,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-31 08:47:06,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:06,194 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-31 08:47:06,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:06,229 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:47:06,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:47:06,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-01-31 08:47:06,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:47:06,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:47:06,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:47:06,312 INFO L87 Difference]: Start difference. First operand 233 states and 262 transitions. Second operand 16 states. [2018-01-31 08:47:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:06,481 INFO L93 Difference]: Finished difference Result 324 states and 363 transitions. [2018-01-31 08:47:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:47:06,481 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-01-31 08:47:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:06,483 INFO L225 Difference]: With dead ends: 324 [2018-01-31 08:47:06,483 INFO L226 Difference]: Without dead ends: 235 [2018-01-31 08:47:06,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:47:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-31 08:47:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 219. [2018-01-31 08:47:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-31 08:47:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 244 transitions. [2018-01-31 08:47:06,515 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 244 transitions. Word has length 80 [2018-01-31 08:47:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:06,516 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 244 transitions. [2018-01-31 08:47:06,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:47:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 244 transitions. [2018-01-31 08:47:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 08:47:06,517 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:06,517 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:47:06,517 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:06,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1582810419, now seen corresponding path program 1 times [2018-01-31 08:47:06,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:06,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:06,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:06,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:06,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:06,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:47:07,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:07,903 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-31 08:47:07,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:07,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:08,020 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 11 treesize of output 8 [2018-01-31 08:47:08,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:47:08,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:08,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:08,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:08,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-31 08:47:08,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-31 08:47:08,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-31 08:47:08,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:08,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:08,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:08,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-31 08:47:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:47:08,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:47:08,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 32 [2018-01-31 08:47:08,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 08:47:08,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 08:47:08,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:47:08,186 INFO L87 Difference]: Start difference. First operand 219 states and 244 transitions. Second operand 33 states. [2018-01-31 08:47:09,797 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 46 DAG size of output 40 [2018-01-31 08:47:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:09,822 INFO L93 Difference]: Finished difference Result 385 states and 434 transitions. [2018-01-31 08:47:09,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-31 08:47:09,823 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 81 [2018-01-31 08:47:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:09,824 INFO L225 Difference]: With dead ends: 385 [2018-01-31 08:47:09,824 INFO L226 Difference]: Without dead ends: 384 [2018-01-31 08:47:09,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=459, Invalid=3701, Unknown=0, NotChecked=0, Total=4160 [2018-01-31 08:47:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-31 08:47:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 338. [2018-01-31 08:47:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-01-31 08:47:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 399 transitions. [2018-01-31 08:47:09,878 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 399 transitions. Word has length 81 [2018-01-31 08:47:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:09,878 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 399 transitions. [2018-01-31 08:47:09,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 08:47:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 399 transitions. [2018-01-31 08:47:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 08:47:09,879 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:09,880 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:47:09,880 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1582810418, now seen corresponding path program 1 times [2018-01-31 08:47:09,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:09,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:09,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:09,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:09,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:09,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:10,647 WARN L146 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 13 DAG size of output 10 [2018-01-31 08:47:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:47:10,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:10,874 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-31 08:47:10,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:10,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:10,944 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-31 08:47:10,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:10,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:10,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:47:10,991 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 11 treesize of output 8 [2018-01-31 08:47:10,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:47:10,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:10,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:10,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:10,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-31 08:47:11,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-31 08:47:11,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-31 08:47:11,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:11,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:11,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:11,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-31 08:47:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:47:11,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:47:11,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 27 [2018-01-31 08:47:11,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 08:47:11,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 08:47:11,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:47:11,222 INFO L87 Difference]: Start difference. First operand 338 states and 399 transitions. Second operand 28 states. [2018-01-31 08:47:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:11,816 INFO L93 Difference]: Finished difference Result 356 states and 420 transitions. [2018-01-31 08:47:11,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:47:11,817 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2018-01-31 08:47:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:11,818 INFO L225 Difference]: With dead ends: 356 [2018-01-31 08:47:11,819 INFO L226 Difference]: Without dead ends: 355 [2018-01-31 08:47:11,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 08:47:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-31 08:47:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 329. [2018-01-31 08:47:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-01-31 08:47:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 387 transitions. [2018-01-31 08:47:11,873 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 387 transitions. Word has length 81 [2018-01-31 08:47:11,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:11,873 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 387 transitions. [2018-01-31 08:47:11,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 08:47:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 387 transitions. [2018-01-31 08:47:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 08:47:11,874 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:11,875 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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-31 08:47:11,875 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:11,875 INFO L82 PathProgramCache]: Analyzing trace with hash -808392189, now seen corresponding path program 1 times [2018-01-31 08:47:11,876 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:11,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:11,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:11,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:11,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:11,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:47:12,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:12,092 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-31 08:47:12,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:12,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:47:12,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:47:12,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2018-01-31 08:47:12,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:47:12,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:47:12,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:47:12,192 INFO L87 Difference]: Start difference. First operand 329 states and 387 transitions. Second operand 16 states. [2018-01-31 08:47:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:12,365 INFO L93 Difference]: Finished difference Result 360 states and 419 transitions. [2018-01-31 08:47:12,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:47:12,368 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-01-31 08:47:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:12,370 INFO L225 Difference]: With dead ends: 360 [2018-01-31 08:47:12,370 INFO L226 Difference]: Without dead ends: 341 [2018-01-31 08:47:12,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:47:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-01-31 08:47:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 314. [2018-01-31 08:47:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-01-31 08:47:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 365 transitions. [2018-01-31 08:47:12,425 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 365 transitions. Word has length 81 [2018-01-31 08:47:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:12,426 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 365 transitions. [2018-01-31 08:47:12,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:47:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 365 transitions. [2018-01-31 08:47:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-31 08:47:12,427 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:12,427 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:47:12,427 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:12,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1959980701, now seen corresponding path program 1 times [2018-01-31 08:47:12,428 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:12,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:12,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:12,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:12,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:12,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:47:12,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:12,599 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:47:12,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:12,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:47:12,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:47:12,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-01-31 08:47:12,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:47:12,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:47:12,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:47:12,699 INFO L87 Difference]: Start difference. First operand 314 states and 365 transitions. Second operand 16 states. [2018-01-31 08:47:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:12,846 INFO L93 Difference]: Finished difference Result 338 states and 386 transitions. [2018-01-31 08:47:12,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:47:12,846 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 84 [2018-01-31 08:47:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:12,848 INFO L225 Difference]: With dead ends: 338 [2018-01-31 08:47:12,848 INFO L226 Difference]: Without dead ends: 319 [2018-01-31 08:47:12,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:47:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-31 08:47:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 312. [2018-01-31 08:47:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-01-31 08:47:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 359 transitions. [2018-01-31 08:47:12,886 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 359 transitions. Word has length 84 [2018-01-31 08:47:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:12,887 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 359 transitions. [2018-01-31 08:47:12,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:47:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 359 transitions. [2018-01-31 08:47:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-31 08:47:12,888 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:12,888 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:47:12,888 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:12,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1949147902, now seen corresponding path program 1 times [2018-01-31 08:47:12,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:12,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:12,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:12,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:12,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:12,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:13,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:13,264 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:47:13,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:13,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:13,314 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-31 08:47:13,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:47:13,378 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 11 treesize of output 8 [2018-01-31 08:47:13,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:47:13,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-31 08:47:13,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:47:13,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:47:13,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:11 [2018-01-31 08:47:13,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-01-31 08:47:13,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-31 08:47:13,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-01-31 08:47:13,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-31 08:47:13,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:13,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:20, output treesize:5 [2018-01-31 08:47:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:13,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:47:13,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-31 08:47:13,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:47:13,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:47:13,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:47:13,759 INFO L87 Difference]: Start difference. First operand 312 states and 359 transitions. Second operand 26 states. [2018-01-31 08:47:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:14,864 INFO L93 Difference]: Finished difference Result 409 states and 476 transitions. [2018-01-31 08:47:14,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:47:14,866 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2018-01-31 08:47:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:14,869 INFO L225 Difference]: With dead ends: 409 [2018-01-31 08:47:14,869 INFO L226 Difference]: Without dead ends: 408 [2018-01-31 08:47:14,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:47:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-01-31 08:47:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 349. [2018-01-31 08:47:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-01-31 08:47:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 397 transitions. [2018-01-31 08:47:14,920 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 397 transitions. Word has length 86 [2018-01-31 08:47:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:14,920 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 397 transitions. [2018-01-31 08:47:14,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:47:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 397 transitions. [2018-01-31 08:47:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-31 08:47:14,921 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:14,922 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:47:14,922 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1937156981, now seen corresponding path program 2 times [2018-01-31 08:47:14,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:14,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:14,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:14,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:14,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:14,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:47:15,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:15,507 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:47:15,512 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:47:15,527 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:47:15,537 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:47:15,540 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:47:15,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:15,560 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-31 08:47:15,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:15,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 08:47:15,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:15,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-31 08:47:15,585 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:15,600 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-31 08:47:15,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:15,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:47:15,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-31 08:47:16,704 WARN L143 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 08:47:16,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:17,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:17,006 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 55 treesize of output 49 [2018-01-31 08:47:17,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:17,043 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 49 treesize of output 48 [2018-01-31 08:47:17,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:17,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:17,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:17,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-01-31 08:47:17,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:17,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:17,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-01-31 08:47:17,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:17,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-31 08:47:17,412 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-31 08:47:19,523 WARN L143 SmtUtils]: Spent 2033ms on a formula simplification that was a NOOP. DAG size: 60 [2018-01-31 08:47:20,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-01-31 08:47:20,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:20,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 100 [2018-01-31 08:47:20,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:47:20,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-31 08:47:20,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:20,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-01-31 08:47:20,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:20,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2018-01-31 08:47:20,685 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-31 08:47:20,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:20,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-01-31 08:47:20,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:21,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:21,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:21,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 90 [2018-01-31 08:47:21,071 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-31 08:47:21,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:21,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:21,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:21,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 92 [2018-01-31 08:47:21,316 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-31 08:47:21,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:21,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:21,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-01-31 08:47:21,576 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:21,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:21,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:21,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-31 08:47:21,579 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:21,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 40 dim-0 vars, and 8 xjuncts. [2018-01-31 08:47:21,807 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 32 variables, input treesize:285, output treesize:437 [2018-01-31 08:47:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:47:22,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:47:22,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-31 08:47:22,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-31 08:47:22,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-31 08:47:22,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1302, Unknown=6, NotChecked=0, Total=1406 [2018-01-31 08:47:22,144 INFO L87 Difference]: Start difference. First operand 349 states and 397 transitions. Second operand 38 states. [2018-01-31 08:47:24,451 WARN L146 SmtUtils]: Spent 2070ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-01-31 08:47:28,622 WARN L146 SmtUtils]: Spent 4120ms on a formula simplification. DAG size of input: 76 DAG size of output 67 [2018-01-31 08:47:30,721 WARN L146 SmtUtils]: Spent 2050ms on a formula simplification. DAG size of input: 52 DAG size of output 51 [2018-01-31 08:47:32,894 WARN L146 SmtUtils]: Spent 2107ms on a formula simplification. DAG size of input: 68 DAG size of output 67 [2018-01-31 08:47:36,990 WARN L146 SmtUtils]: Spent 4056ms on a formula simplification. DAG size of input: 51 DAG size of output 51 [2018-01-31 08:47:37,476 WARN L146 SmtUtils]: Spent 370ms on a formula simplification. DAG size of input: 58 DAG size of output 53 [2018-01-31 08:47:39,644 WARN L146 SmtUtils]: Spent 2069ms on a formula simplification. DAG size of input: 65 DAG size of output 55 Received shutdown request... [2018-01-31 08:47:43,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:47:43,736 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:47:43,740 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:47:43,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:47:43 BoogieIcfgContainer [2018-01-31 08:47:43,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:47:43,741 INFO L168 Benchmark]: Toolchain (without parser) took 151171.32 ms. Allocated memory was 304.6 MB in the beginning and 655.4 MB in the end (delta: 350.7 MB). Free memory was 263.3 MB in the beginning and 469.2 MB in the end (delta: -205.9 MB). Peak memory consumption was 144.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:47:43,742 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 304.6 MB. Free memory is still 270.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:47:43,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.15 ms. Allocated memory is still 304.6 MB. Free memory was 263.3 MB in the beginning and 249.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:47:43,742 INFO L168 Benchmark]: Boogie Preprocessor took 50.36 ms. Allocated memory is still 304.6 MB. Free memory was 249.3 MB in the beginning and 248.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-31 08:47:43,742 INFO L168 Benchmark]: RCFGBuilder took 713.05 ms. Allocated memory is still 304.6 MB. Free memory was 247.3 MB in the beginning and 221.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:47:43,742 INFO L168 Benchmark]: TraceAbstraction took 150052.53 ms. Allocated memory was 304.6 MB in the beginning and 655.4 MB in the end (delta: 350.7 MB). Free memory was 221.3 MB in the beginning and 469.2 MB in the end (delta: -247.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:47:43,744 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.16 ms. Allocated memory is still 304.6 MB. Free memory is still 270.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 342.15 ms. Allocated memory is still 304.6 MB. Free memory was 263.3 MB in the beginning and 249.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.36 ms. Allocated memory is still 304.6 MB. Free memory was 249.3 MB in the beginning and 248.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 713.05 ms. Allocated memory is still 304.6 MB. Free memory was 247.3 MB in the beginning and 221.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 150052.53 ms. Allocated memory was 304.6 MB in the beginning and 655.4 MB in the end (delta: 350.7 MB). Free memory was 221.3 MB in the beginning and 469.2 MB in the end (delta: -247.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 11 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 113 locations, 17 error locations. TIMEOUT Result, 149.9s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 124.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2648 SDtfs, 3701 SDslu, 18635 SDs, 0 SdLazy, 9740 SolverSat, 462 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 33.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1696 GetRequests, 1117 SyntacticMatches, 24 SemanticMatches, 554 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3748 ImplicationChecksByTransitivity, 101.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=24, 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.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 621 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 2836 NumberOfCodeBlocks, 2836 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2795 ConstructedInterpolants, 155 QuantifiedInterpolants, 1265582 SizeOfPredicates, 125 NumberOfNonLiveVariables, 3200 ConjunctsInSsa, 354 ConjunctsInUnsatCore, 41 InterpolantComputations, 11 PerfectInterpolantSequences, 280/419 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_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-47-43-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-47-43-753.csv Completed graceful shutdown