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-1cceb4a [2018-01-30 00:13:14,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:13:14,492 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:13:14,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:13:14,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:13:14,509 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:13:14,510 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:13:14,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:13:14,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:13:14,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:13:14,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:13:14,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:13:14,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:13:14,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:13:14,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:13:14,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:13:14,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:13:14,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:13:14,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:13:14,528 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:13:14,530 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:13:14,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:13:14,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:13:14,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:13:14,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:13:14,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:13:14,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:13:14,535 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:13:14,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:13:14,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:13:14,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:13:14,536 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-30 00:13:14,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:13:14,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:13:14,545 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:13:14,546 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:13:14,546 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:13:14,546 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:13:14,546 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:13:14,546 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:13:14,547 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:13:14,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:13:14,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:13:14,547 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:13:14,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:13:14,547 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:13:14,547 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:13:14,548 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:13:14,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:13:14,548 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:13:14,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:13:14,548 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:13:14,548 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:13:14,548 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:13:14,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:13:14,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:13:14,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:13:14,549 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:13:14,549 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:13:14,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:13:14,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:13:14,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:13:14,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:13:14,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:13:14,551 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:13:14,551 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:13:14,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:13:14,595 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:13:14,598 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:13:14,599 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:13:14,600 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:13:14,600 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-30 00:13:14,775 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:13:14,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:13:14,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:13:14,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:13:14,785 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:13:14,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:13:14" (1/1) ... [2018-01-30 00:13:14,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2767fafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:14, skipping insertion in model container [2018-01-30 00:13:14,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:13:14" (1/1) ... [2018-01-30 00:13:14,802 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:13:14,850 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:13:14,970 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:13:14,992 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:13:15,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:15 WrapperNode [2018-01-30 00:13:15,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:13:15,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:13:15,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:13:15,002 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:13:15,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:15" (1/1) ... [2018-01-30 00:13:15,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:15" (1/1) ... [2018-01-30 00:13:15,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:15" (1/1) ... [2018-01-30 00:13:15,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:15" (1/1) ... [2018-01-30 00:13:15,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:15" (1/1) ... [2018-01-30 00:13:15,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:15" (1/1) ... [2018-01-30 00:13:15,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:15" (1/1) ... [2018-01-30 00:13:15,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:13:15,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:13:15,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:13:15,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:13:15,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:15" (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-30 00:13:15,106 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:13:15,106 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:13:15,106 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-01-30 00:13:15,106 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:13:15,106 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-30 00:13:15,107 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-30 00:13:15,107 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:13:15,107 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:13:15,107 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:13:15,107 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:13:15,107 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:13:15,107 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:13:15,107 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:13:15,107 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:13:15,107 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:13:15,108 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:13:15,108 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-01-30 00:13:15,108 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:13:15,108 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-30 00:13:15,108 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-30 00:13:15,108 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-30 00:13:15,108 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:13:15,108 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:13:15,108 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:13:15,108 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:13:15,451 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:13:15,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:13:15 BoogieIcfgContainer [2018-01-30 00:13:15,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:13:15,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:13:15,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:13:15,456 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:13:15,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:13:14" (1/3) ... [2018-01-30 00:13:15,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d431f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:13:15, skipping insertion in model container [2018-01-30 00:13:15,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:13:15" (2/3) ... [2018-01-30 00:13:15,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d431f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:13:15, skipping insertion in model container [2018-01-30 00:13:15,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:13:15" (3/3) ... [2018-01-30 00:13:15,459 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-30 00:13:15,465 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:13:15,471 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-30 00:13:15,512 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:13:15,513 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:13:15,513 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:13:15,513 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:13:15,513 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:13:15,513 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:13:15,514 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:13:15,514 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:13:15,515 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:13:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-01-30 00:13:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:13:15,539 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:15,540 INFO L350 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-30 00:13:15,540 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-30 00:13:15,544 INFO L82 PathProgramCache]: Analyzing trace with hash 807914669, now seen corresponding path program 1 times [2018-01-30 00:13:15,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:15,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:15,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:15,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:15,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:15,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:15,766 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-30 00:13:15,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:13:15,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:13:15,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:13:15,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:13:15,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:13:15,856 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 3 states. [2018-01-30 00:13:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:16,048 INFO L93 Difference]: Finished difference Result 251 states and 292 transitions. [2018-01-30 00:13:16,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:13:16,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-30 00:13:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:16,060 INFO L225 Difference]: With dead ends: 251 [2018-01-30 00:13:16,060 INFO L226 Difference]: Without dead ends: 166 [2018-01-30 00:13:16,063 INFO L553 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-30 00:13:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-30 00:13:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 115. [2018-01-30 00:13:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-30 00:13:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-30 00:13:16,103 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 34 [2018-01-30 00:13:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:16,104 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-30 00:13:16,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:13:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-30 00:13:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:13:16,105 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:16,106 INFO L350 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-30 00:13:16,106 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-30 00:13:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1388598547, now seen corresponding path program 1 times [2018-01-30 00:13:16,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:16,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:16,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:16,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:16,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:16,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:16,199 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-30 00:13:16,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:13:16,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:13:16,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:13:16,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:13:16,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:13:16,232 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 6 states. [2018-01-30 00:13:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:16,376 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2018-01-30 00:13:16,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:13:16,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-30 00:13:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:16,379 INFO L225 Difference]: With dead ends: 136 [2018-01-30 00:13:16,379 INFO L226 Difference]: Without dead ends: 132 [2018-01-30 00:13:16,380 INFO L553 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-30 00:13:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-30 00:13:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 110. [2018-01-30 00:13:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-30 00:13:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-01-30 00:13:16,392 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 35 [2018-01-30 00:13:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:16,393 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-01-30 00:13:16,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:13:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-01-30 00:13:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:13:16,394 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:16,394 INFO L350 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-30 00:13:16,395 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-30 00:13:16,395 INFO L82 PathProgramCache]: Analyzing trace with hash -752147610, now seen corresponding path program 1 times [2018-01-30 00:13:16,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:16,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:16,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:16,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:16,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:16,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:16,472 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-30 00:13:16,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:13:16,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:13:16,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:13:16,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:13:16,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:13:16,474 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 5 states. [2018-01-30 00:13:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:16,520 INFO L93 Difference]: Finished difference Result 200 states and 213 transitions. [2018-01-30 00:13:16,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:13:16,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-30 00:13:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:16,523 INFO L225 Difference]: With dead ends: 200 [2018-01-30 00:13:16,523 INFO L226 Difference]: Without dead ends: 112 [2018-01-30 00:13:16,524 INFO L553 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-30 00:13:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-30 00:13:16,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-30 00:13:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 00:13:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-30 00:13:16,532 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 35 [2018-01-30 00:13:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:16,532 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-30 00:13:16,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:13:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-30 00:13:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:13:16,533 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:16,533 INFO L350 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-30 00:13:16,533 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-30 00:13:16,533 INFO L82 PathProgramCache]: Analyzing trace with hash -124580570, now seen corresponding path program 1 times [2018-01-30 00:13:16,533 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:16,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:16,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:16,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:16,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:16,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:16,597 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-30 00:13:16,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:13:16,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:13:16,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:13:16,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:13:16,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:13:16,598 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 6 states. [2018-01-30 00:13:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:16,713 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-01-30 00:13:16,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:13:16,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-30 00:13:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:16,716 INFO L225 Difference]: With dead ends: 112 [2018-01-30 00:13:16,716 INFO L226 Difference]: Without dead ends: 111 [2018-01-30 00:13:16,717 INFO L553 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-30 00:13:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-30 00:13:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-30 00:13:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 00:13:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-01-30 00:13:16,727 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 36 [2018-01-30 00:13:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:16,728 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-01-30 00:13:16,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:13:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-01-30 00:13:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:13:16,729 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:16,729 INFO L350 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-30 00:13:16,729 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-30 00:13:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash -124580569, now seen corresponding path program 1 times [2018-01-30 00:13:16,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:16,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:16,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:16,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:16,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:16,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:17,136 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-30 00:13:17,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:13:17,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-30 00:13:17,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:13:17,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:13:17,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:13:17,137 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 13 states. [2018-01-30 00:13:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:17,506 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-01-30 00:13:17,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:13:17,506 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-01-30 00:13:17,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:17,507 INFO L225 Difference]: With dead ends: 197 [2018-01-30 00:13:17,507 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 00:13:17,508 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:13:17,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 00:13:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-01-30 00:13:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 00:13:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-01-30 00:13:17,519 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 36 [2018-01-30 00:13:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:17,519 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-01-30 00:13:17,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:13:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-01-30 00:13:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:13:17,521 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:17,521 INFO L350 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-30 00:13:17,521 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-30 00:13:17,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1474274973, now seen corresponding path program 1 times [2018-01-30 00:13:17,522 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:17,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:17,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:17,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:17,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:17,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:17,753 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-30 00:13:17,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:17,754 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-30 00:13:17,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:17,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:17,853 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-30 00:13:17,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:17,868 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-30 00:13:17,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:17,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:13:17,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:13:18,259 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-30 00:13:18,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:18,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-01-30 00:13:18,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 00:13:18,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 00:13:18,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:13:18,289 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 23 states. [2018-01-30 00:13:19,070 WARN L146 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 27 DAG size of output 25 [2018-01-30 00:13:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:19,205 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-30 00:13:19,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:13:19,206 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-01-30 00:13:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:19,207 INFO L225 Difference]: With dead ends: 117 [2018-01-30 00:13:19,207 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 00:13:19,208 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2018-01-30 00:13:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 00:13:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-30 00:13:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 00:13:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-30 00:13:19,216 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 42 [2018-01-30 00:13:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:19,217 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-30 00:13:19,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 00:13:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-30 00:13:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 00:13:19,219 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:19,219 INFO L350 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-30 00:13:19,219 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-30 00:13:19,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1536057818, now seen corresponding path program 1 times [2018-01-30 00:13:19,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:19,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:19,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:19,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:19,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:19,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:19,308 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-30 00:13:19,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:13:19,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:13:19,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:13:19,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:13:19,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:13:19,310 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 5 states. [2018-01-30 00:13:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:19,341 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2018-01-30 00:13:19,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:13:19,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-01-30 00:13:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:19,343 INFO L225 Difference]: With dead ends: 189 [2018-01-30 00:13:19,343 INFO L226 Difference]: Without dead ends: 117 [2018-01-30 00:13:19,344 INFO L553 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-30 00:13:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-30 00:13:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-01-30 00:13:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-30 00:13:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-01-30 00:13:19,353 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 61 [2018-01-30 00:13:19,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:19,354 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-01-30 00:13:19,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:13:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-01-30 00:13:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:13:19,356 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:19,356 INFO L350 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-30 00:13:19,356 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-30 00:13:19,357 INFO L82 PathProgramCache]: Analyzing trace with hash 429771204, now seen corresponding path program 1 times [2018-01-30 00:13:19,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:19,357 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:19,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:19,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:19,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:19,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:19,432 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-30 00:13:19,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:13:19,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:13:19,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:13:19,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:13:19,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:13:19,433 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 6 states. [2018-01-30 00:13:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:19,623 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2018-01-30 00:13:19,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:13:19,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-01-30 00:13:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:19,626 INFO L225 Difference]: With dead ends: 165 [2018-01-30 00:13:19,626 INFO L226 Difference]: Without dead ends: 163 [2018-01-30 00:13:19,626 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:13:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-30 00:13:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2018-01-30 00:13:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-30 00:13:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2018-01-30 00:13:19,637 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 62 [2018-01-30 00:13:19,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:19,637 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2018-01-30 00:13:19,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:13:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2018-01-30 00:13:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:13:19,639 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:19,639 INFO L350 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-30 00:13:19,639 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-30 00:13:19,639 INFO L82 PathProgramCache]: Analyzing trace with hash 429771205, now seen corresponding path program 1 times [2018-01-30 00:13:19,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:19,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:19,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:19,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:19,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:19,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:19,756 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-30 00:13:19,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:13:19,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 00:13:19,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:13:19,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:13:19,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:13:19,757 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand 11 states. [2018-01-30 00:13:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:20,160 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2018-01-30 00:13:20,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:13:20,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-30 00:13:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:20,163 INFO L225 Difference]: With dead ends: 208 [2018-01-30 00:13:20,163 INFO L226 Difference]: Without dead ends: 171 [2018-01-30 00:13:20,163 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:13:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-30 00:13:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2018-01-30 00:13:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-30 00:13:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-01-30 00:13:20,174 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 62 [2018-01-30 00:13:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:20,175 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-01-30 00:13:20,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:13:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-01-30 00:13:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:13:20,176 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:20,176 INFO L350 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-30 00:13:20,176 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-30 00:13:20,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1731911702, now seen corresponding path program 1 times [2018-01-30 00:13:20,176 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:20,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:20,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:20,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:20,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:20,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:20,322 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-30 00:13:20,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:20,322 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-30 00:13:20,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:20,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:20,354 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-30 00:13:20,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:20,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:13:20,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:13:20,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:20,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:20,392 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-30 00:13:20,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:20,402 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-30 00:13:20,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-30 00:13:20,425 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-30 00:13:20,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:20,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-01-30 00:13:20,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:13:20,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:13:20,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:13:20,446 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 13 states. [2018-01-30 00:13:20,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:13:20,912 INFO L93 Difference]: Finished difference Result 195 states and 221 transitions. [2018-01-30 00:13:20,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:13:20,912 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-01-30 00:13:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:13:20,914 INFO L225 Difference]: With dead ends: 195 [2018-01-30 00:13:20,914 INFO L226 Difference]: Without dead ends: 192 [2018-01-30 00:13:20,915 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:13:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-30 00:13:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 149. [2018-01-30 00:13:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-30 00:13:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-01-30 00:13:20,931 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 62 [2018-01-30 00:13:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:13:20,932 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-01-30 00:13:20,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:13:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-01-30 00:13:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:13:20,933 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:13:20,933 INFO L350 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-30 00:13:20,933 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-30 00:13:20,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1731911703, now seen corresponding path program 1 times [2018-01-30 00:13:20,934 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:13:20,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:13:20,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:20,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:20,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:13:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:20,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:13:21,273 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-30 00:13:21,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:13:21,308 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-30 00:13:21,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:13:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:13:21,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:13:21,369 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-30 00:13:21,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:21,388 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-30 00:13:21,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:21,407 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-30 00:13:21,407 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:21,410 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-30 00:13:21,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:21,428 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-30 00:13:21,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-30 00:13:22,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:22,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:22,101 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-30 00:13:22,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:22,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:22,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:22,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-01-30 00:13:22,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:22,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:22,173 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-30 00:13:22,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:22,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:22,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:13:22,205 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-30 00:13:22,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:13:22,229 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-30 00:13:22,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:101, output treesize:83 [2018-01-30 00:13:22,355 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-30 00:13:22,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:13:22,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-30 00:13:22,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 00:13:22,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 00:13:22,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=543, Unknown=1, NotChecked=0, Total=600 [2018-01-30 00:13:22,385 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 25 states. [2018-01-30 00:13:24,660 WARN L146 SmtUtils]: Spent 2088ms on a formula simplification. DAG size of input: 60 DAG size of output 56 [2018-01-30 00:13:31,371 WARN L146 SmtUtils]: Spent 6637ms on a formula simplification. DAG size of input: 77 DAG size of output 72 [2018-01-30 00:13:39,644 WARN L146 SmtUtils]: Spent 8109ms on a formula simplification. DAG size of input: 69 DAG size of output 68 [2018-01-30 00:13:43,728 WARN L146 SmtUtils]: Spent 4054ms on a formula simplification. DAG size of input: 52 DAG size of output 52 [2018-01-30 00:13:45,823 WARN L146 SmtUtils]: Spent 2054ms on a formula simplification. DAG size of input: 54 DAG size of output 54 [2018-01-30 00:14:17,884 WARN L146 SmtUtils]: Spent 21027ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-01-30 00:14:40,210 WARN L146 SmtUtils]: Spent 22273ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-01-30 00:14:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:40,840 INFO L93 Difference]: Finished difference Result 255 states and 280 transitions. [2018-01-30 00:14:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 00:14:40,840 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-01-30 00:14:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:40,842 INFO L225 Difference]: With dead ends: 255 [2018-01-30 00:14:40,842 INFO L226 Difference]: Without dead ends: 254 [2018-01-30 00:14:40,843 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 67.9s TimeCoverageRelationStatistics Valid=192, Invalid=1444, Unknown=4, NotChecked=0, Total=1640 [2018-01-30 00:14:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-30 00:14:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 153. [2018-01-30 00:14:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-30 00:14:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2018-01-30 00:14:40,867 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 62 [2018-01-30 00:14:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:40,868 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2018-01-30 00:14:40,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 00:14:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2018-01-30 00:14:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 00:14:40,869 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:40,869 INFO L350 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-30 00:14:40,869 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-30 00:14:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2118368878, now seen corresponding path program 1 times [2018-01-30 00:14:40,869 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:40,869 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:40,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:40,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:40,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:40,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:40,986 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-30 00:14:40,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:40,986 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-30 00:14:40,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:41,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:41,026 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-30 00:14:41,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:14:41,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 10 [2018-01-30 00:14:41,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:14:41,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:14:41,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:14:41,047 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 10 states. [2018-01-30 00:14:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:41,308 INFO L93 Difference]: Finished difference Result 276 states and 312 transitions. [2018-01-30 00:14:41,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:14:41,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-01-30 00:14:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:41,313 INFO L225 Difference]: With dead ends: 276 [2018-01-30 00:14:41,313 INFO L226 Difference]: Without dead ends: 228 [2018-01-30 00:14:41,314 INFO L553 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-30 00:14:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-30 00:14:41,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 204. [2018-01-30 00:14:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-30 00:14:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2018-01-30 00:14:41,343 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 64 [2018-01-30 00:14:41,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:41,343 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2018-01-30 00:14:41,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:14:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2018-01-30 00:14:41,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-30 00:14:41,344 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:41,344 INFO L350 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-30 00:14:41,344 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-30 00:14:41,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1181630033, now seen corresponding path program 1 times [2018-01-30 00:14:41,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:41,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:41,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:41,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:41,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:41,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:41,474 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-30 00:14:41,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:14:41,474 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-30 00:14:41,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:41,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:14:41,517 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-30 00:14:41,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:41,535 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-30 00:14:41,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:14:41,547 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-30 00:14:41,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-30 00:14:42,039 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-30 00:14:42,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:14:42,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-30 00:14:42,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 00:14:42,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 00:14:42,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:14:42,060 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand 20 states. [2018-01-30 00:14:44,394 WARN L143 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 00:14:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:59,520 INFO L93 Difference]: Finished difference Result 230 states and 255 transitions. [2018-01-30 00:14:59,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:14:59,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 76 [2018-01-30 00:14:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:59,522 INFO L225 Difference]: With dead ends: 230 [2018-01-30 00:14:59,522 INFO L226 Difference]: Without dead ends: 229 [2018-01-30 00:14:59,522 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=120, Invalid=871, Unknown=1, NotChecked=0, Total=992 [2018-01-30 00:14:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-30 00:14:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 214. [2018-01-30 00:14:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-30 00:14:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 243 transitions. [2018-01-30 00:14:59,559 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 243 transitions. Word has length 76 [2018-01-30 00:14:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:59,560 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 243 transitions. [2018-01-30 00:14:59,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 00:14:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 243 transitions. [2018-01-30 00:14:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 00:14:59,561 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:59,561 INFO L350 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-30 00:14:59,561 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-30 00:14:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1841193406, now seen corresponding path program 1 times [2018-01-30 00:14:59,562 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:59,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:59,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:59,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:59,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:59,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:59,621 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-30 00:14:59,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:14:59,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:14:59,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:14:59,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:14:59,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:14:59,622 INFO L87 Difference]: Start difference. First operand 214 states and 243 transitions. Second operand 6 states. [2018-01-30 00:14:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:14:59,679 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2018-01-30 00:14:59,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:14:59,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-01-30 00:14:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:14:59,681 INFO L225 Difference]: With dead ends: 282 [2018-01-30 00:14:59,681 INFO L226 Difference]: Without dead ends: 215 [2018-01-30 00:14:59,681 INFO L553 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-30 00:14:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-30 00:14:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-01-30 00:14:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-30 00:14:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2018-01-30 00:14:59,703 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 77 [2018-01-30 00:14:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:14:59,703 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2018-01-30 00:14:59,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:14:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2018-01-30 00:14:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 00:14:59,714 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:14:59,714 INFO L350 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-30 00:14:59,714 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-30 00:14:59,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2024174689, now seen corresponding path program 1 times [2018-01-30 00:14:59,715 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:14:59,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:14:59,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:59,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:14:59,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:14:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:14:59,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:14:59,999 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-30 00:14:59,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:00,000 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-30 00:15:00,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:00,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:00,074 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-30 00:15:00,076 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-30 00:15:00,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:00,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:00,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:00,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-30 00:15:00,166 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-30 00:15:00,168 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-30 00:15:00,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:00,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:00,171 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-30 00:15:00,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-30 00:15:00,187 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-30 00:15:00,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:00,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2018-01-30 00:15:00,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 00:15:00,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 00:15:00,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:15:00,220 INFO L87 Difference]: Start difference. First operand 211 states and 236 transitions. Second operand 19 states. [2018-01-30 00:15:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:00,807 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2018-01-30 00:15:00,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:15:00,807 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-01-30 00:15:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:00,808 INFO L225 Difference]: With dead ends: 226 [2018-01-30 00:15:00,808 INFO L226 Difference]: Without dead ends: 225 [2018-01-30 00:15:00,809 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2018-01-30 00:15:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-30 00:15:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 212. [2018-01-30 00:15:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-30 00:15:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 238 transitions. [2018-01-30 00:15:00,832 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 238 transitions. Word has length 77 [2018-01-30 00:15:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:00,832 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 238 transitions. [2018-01-30 00:15:00,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 00:15:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 238 transitions. [2018-01-30 00:15:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 00:15:00,833 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:00,833 INFO L350 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-30 00:15:00,833 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-30 00:15:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2024174690, now seen corresponding path program 1 times [2018-01-30 00:15:00,833 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:00,833 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:00,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:00,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:00,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:00,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:01,064 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-30 00:15:01,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:01,064 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-30 00:15:01,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:01,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:01,135 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-30 00:15:01,137 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-30 00:15:01,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:01,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:01,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:01,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-30 00:15:01,210 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-30 00:15:01,212 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-30 00:15:01,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:01,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:01,214 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-30 00:15:01,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-30 00:15:01,262 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-30 00:15:01,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:01,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2018-01-30 00:15:01,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 00:15:01,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 00:15:01,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:15:01,285 INFO L87 Difference]: Start difference. First operand 212 states and 238 transitions. Second operand 19 states. [2018-01-30 00:15:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:01,789 INFO L93 Difference]: Finished difference Result 225 states and 246 transitions. [2018-01-30 00:15:01,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:15:01,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-01-30 00:15:01,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:01,791 INFO L225 Difference]: With dead ends: 225 [2018-01-30 00:15:01,792 INFO L226 Difference]: Without dead ends: 224 [2018-01-30 00:15:01,792 INFO L553 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-30 00:15:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-30 00:15:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2018-01-30 00:15:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-30 00:15:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2018-01-30 00:15:01,824 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 77 [2018-01-30 00:15:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:01,825 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2018-01-30 00:15:01,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 00:15:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2018-01-30 00:15:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 00:15:01,826 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:01,826 INFO L350 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-30 00:15:01,826 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-30 00:15:01,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1195867586, now seen corresponding path program 1 times [2018-01-30 00:15:01,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:01,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:01,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:01,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:01,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:01,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:01,902 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-30 00:15:01,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:01,903 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-30 00:15:01,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:01,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:01,993 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-30 00:15:02,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:02,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-30 00:15:02,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:15:02,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:15:02,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:15:02,028 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand 7 states. [2018-01-30 00:15:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:02,215 INFO L93 Difference]: Finished difference Result 238 states and 265 transitions. [2018-01-30 00:15:02,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:15:02,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2018-01-30 00:15:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:02,217 INFO L225 Difference]: With dead ends: 238 [2018-01-30 00:15:02,217 INFO L226 Difference]: Without dead ends: 236 [2018-01-30 00:15:02,218 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:15:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-30 00:15:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2018-01-30 00:15:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-30 00:15:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2018-01-30 00:15:02,252 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 80 [2018-01-30 00:15:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:02,252 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2018-01-30 00:15:02,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:15:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2018-01-30 00:15:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 00:15:02,254 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:02,254 INFO L350 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-30 00:15:02,254 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-30 00:15:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1195867587, now seen corresponding path program 1 times [2018-01-30 00:15:02,255 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:02,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:02,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:02,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:02,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:02,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:02,611 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-30 00:15:02,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:02,612 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-30 00:15:02,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:02,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:02,914 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-30 00:15:02,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:02,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 26 [2018-01-30 00:15:02,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:15:02,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:15:02,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:15:02,935 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand 27 states. [2018-01-30 00:15:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:03,870 INFO L93 Difference]: Finished difference Result 320 states and 358 transitions. [2018-01-30 00:15:03,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 00:15:03,871 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2018-01-30 00:15:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:03,873 INFO L225 Difference]: With dead ends: 320 [2018-01-30 00:15:03,873 INFO L226 Difference]: Without dead ends: 319 [2018-01-30 00:15:03,874 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=1854, Unknown=0, NotChecked=0, Total=2070 [2018-01-30 00:15:03,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-30 00:15:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 233. [2018-01-30 00:15:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-01-30 00:15:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 262 transitions. [2018-01-30 00:15:03,912 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 262 transitions. Word has length 80 [2018-01-30 00:15:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:03,913 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 262 transitions. [2018-01-30 00:15:03,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:15:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 262 transitions. [2018-01-30 00:15:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 00:15:03,914 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:03,914 INFO L350 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-30 00:15:03,915 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-30 00:15:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1796959211, now seen corresponding path program 1 times [2018-01-30 00:15:03,915 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:03,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:03,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:03,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:03,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:03,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:04,093 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-30 00:15:04,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:04,093 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-30 00:15:04,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:04,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:04,368 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-30 00:15:04,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:04,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-01-30 00:15:04,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:15:04,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:15:04,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:15:04,390 INFO L87 Difference]: Start difference. First operand 233 states and 262 transitions. Second operand 16 states. [2018-01-30 00:15:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:04,637 INFO L93 Difference]: Finished difference Result 324 states and 363 transitions. [2018-01-30 00:15:04,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:15:04,637 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-01-30 00:15:04,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:04,639 INFO L225 Difference]: With dead ends: 324 [2018-01-30 00:15:04,639 INFO L226 Difference]: Without dead ends: 235 [2018-01-30 00:15:04,640 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:15:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-30 00:15:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 219. [2018-01-30 00:15:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-30 00:15:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 244 transitions. [2018-01-30 00:15:04,673 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 244 transitions. Word has length 80 [2018-01-30 00:15:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:04,673 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 244 transitions. [2018-01-30 00:15:04,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:15:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 244 transitions. [2018-01-30 00:15:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 00:15:04,674 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:04,675 INFO L350 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-30 00:15:04,675 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-30 00:15:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1582810419, now seen corresponding path program 1 times [2018-01-30 00:15:04,675 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:04,675 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:04,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:04,676 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:04,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:04,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:05,344 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-30 00:15:05,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:05,344 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-30 00:15:05,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:05,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:05,454 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-30 00:15:05,456 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-30 00:15:05,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:05,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:05,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:05,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-30 00:15:05,550 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-30 00:15:05,551 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-30 00:15:05,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:05,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:05,553 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-30 00:15:05,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-30 00:15:05,568 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-30 00:15:05,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:05,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 32 [2018-01-30 00:15:05,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 00:15:05,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 00:15:05,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:15:05,589 INFO L87 Difference]: Start difference. First operand 219 states and 244 transitions. Second operand 33 states. [2018-01-30 00:15:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:06,974 INFO L93 Difference]: Finished difference Result 385 states and 434 transitions. [2018-01-30 00:15:06,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-30 00:15:06,974 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 81 [2018-01-30 00:15:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:06,976 INFO L225 Difference]: With dead ends: 385 [2018-01-30 00:15:06,976 INFO L226 Difference]: Without dead ends: 384 [2018-01-30 00:15:06,977 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=459, Invalid=3701, Unknown=0, NotChecked=0, Total=4160 [2018-01-30 00:15:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-30 00:15:07,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 338. [2018-01-30 00:15:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-01-30 00:15:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 399 transitions. [2018-01-30 00:15:07,031 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 399 transitions. Word has length 81 [2018-01-30 00:15:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:07,032 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 399 transitions. [2018-01-30 00:15:07,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 00:15:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 399 transitions. [2018-01-30 00:15:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 00:15:07,033 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:07,033 INFO L350 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-30 00:15:07,033 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-30 00:15:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1582810418, now seen corresponding path program 1 times [2018-01-30 00:15:07,034 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:07,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:07,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:07,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:07,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:07,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:07,458 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-30 00:15:07,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:07,458 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-30 00:15:07,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:07,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:07,781 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-30 00:15:07,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:07,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:07,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:15:07,878 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-30 00:15:07,880 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-30 00:15:07,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:07,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:07,884 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-30 00:15:07,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-30 00:15:07,963 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-30 00:15:07,965 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-30 00:15:07,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:07,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:07,967 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-30 00:15:07,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-30 00:15:07,973 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-30 00:15:07,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:07,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 27 [2018-01-30 00:15:07,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 00:15:07,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 00:15:07,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:15:07,993 INFO L87 Difference]: Start difference. First operand 338 states and 399 transitions. Second operand 28 states. [2018-01-30 00:15:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:08,505 INFO L93 Difference]: Finished difference Result 356 states and 420 transitions. [2018-01-30 00:15:08,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-30 00:15:08,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2018-01-30 00:15:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:08,507 INFO L225 Difference]: With dead ends: 356 [2018-01-30 00:15:08,507 INFO L226 Difference]: Without dead ends: 355 [2018-01-30 00:15:08,507 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 00:15:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-30 00:15:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 329. [2018-01-30 00:15:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-01-30 00:15:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 387 transitions. [2018-01-30 00:15:08,552 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 387 transitions. Word has length 81 [2018-01-30 00:15:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:08,552 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 387 transitions. [2018-01-30 00:15:08,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 00:15:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 387 transitions. [2018-01-30 00:15:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 00:15:08,553 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:08,553 INFO L350 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-30 00:15:08,553 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-30 00:15:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash -808392189, now seen corresponding path program 1 times [2018-01-30 00:15:08,553 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:08,553 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:08,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:08,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:08,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:08,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:08,706 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-30 00:15:08,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:08,706 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-30 00:15:08,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:08,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:08,837 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-30 00:15:08,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:15:08,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2018-01-30 00:15:08,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:15:08,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:15:08,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:15:08,890 INFO L87 Difference]: Start difference. First operand 329 states and 387 transitions. Second operand 16 states. [2018-01-30 00:15:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:09,057 INFO L93 Difference]: Finished difference Result 360 states and 419 transitions. [2018-01-30 00:15:09,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:15:09,057 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-01-30 00:15:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:09,059 INFO L225 Difference]: With dead ends: 360 [2018-01-30 00:15:09,059 INFO L226 Difference]: Without dead ends: 341 [2018-01-30 00:15:09,059 INFO L553 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-30 00:15:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-01-30 00:15:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 314. [2018-01-30 00:15:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-01-30 00:15:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 365 transitions. [2018-01-30 00:15:09,112 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 365 transitions. Word has length 81 [2018-01-30 00:15:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:09,113 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 365 transitions. [2018-01-30 00:15:09,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:15:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 365 transitions. [2018-01-30 00:15:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 00:15:09,114 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:09,114 INFO L350 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-30 00:15:09,114 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-30 00:15:09,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1959980701, now seen corresponding path program 1 times [2018-01-30 00:15:09,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:09,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:09,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:09,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:09,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:09,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:09,227 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-30 00:15:09,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:09,227 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-30 00:15:09,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:09,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:09,309 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-30 00:15:09,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:09,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-01-30 00:15:09,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:15:09,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:15:09,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:15:09,331 INFO L87 Difference]: Start difference. First operand 314 states and 365 transitions. Second operand 16 states. [2018-01-30 00:15:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:09,475 INFO L93 Difference]: Finished difference Result 338 states and 386 transitions. [2018-01-30 00:15:09,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:15:09,476 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 84 [2018-01-30 00:15:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:09,478 INFO L225 Difference]: With dead ends: 338 [2018-01-30 00:15:09,478 INFO L226 Difference]: Without dead ends: 319 [2018-01-30 00:15:09,479 INFO L553 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-30 00:15:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-30 00:15:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 312. [2018-01-30 00:15:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-01-30 00:15:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 359 transitions. [2018-01-30 00:15:09,532 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 359 transitions. Word has length 84 [2018-01-30 00:15:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:09,532 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 359 transitions. [2018-01-30 00:15:09,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:15:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 359 transitions. [2018-01-30 00:15:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-30 00:15:09,534 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:09,534 INFO L350 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-30 00:15:09,534 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-30 00:15:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1949147902, now seen corresponding path program 1 times [2018-01-30 00:15:09,534 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:09,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:09,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:09,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:09,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:09,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:10,143 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-30 00:15:10,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:10,143 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-30 00:15:10,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:10,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:10,202 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-30 00:15:10,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:10,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:10,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:15:10,406 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-30 00:15:10,409 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-30 00:15:10,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:10,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:10,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:10,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-30 00:15:10,511 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-30 00:15:10,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:10,515 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-30 00:15:10,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:11 [2018-01-30 00:15:10,877 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-30 00:15:10,880 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-30 00:15:10,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:10,889 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-30 00:15:10,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:10,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-30 00:15:10,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:10,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:10,898 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-30 00:15:10,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:20, output treesize:5 [2018-01-30 00:15:10,920 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-30 00:15:10,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:10,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-30 00:15:10,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 00:15:10,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 00:15:10,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-01-30 00:15:10,955 INFO L87 Difference]: Start difference. First operand 312 states and 359 transitions. Second operand 26 states. [2018-01-30 00:15:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:11,932 INFO L93 Difference]: Finished difference Result 409 states and 476 transitions. [2018-01-30 00:15:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 00:15:11,932 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2018-01-30 00:15:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:11,934 INFO L225 Difference]: With dead ends: 409 [2018-01-30 00:15:11,934 INFO L226 Difference]: Without dead ends: 408 [2018-01-30 00:15:11,935 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2018-01-30 00:15:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-01-30 00:15:11,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 349. [2018-01-30 00:15:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-01-30 00:15:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 397 transitions. [2018-01-30 00:15:11,994 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 397 transitions. Word has length 86 [2018-01-30 00:15:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:11,994 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 397 transitions. [2018-01-30 00:15:11,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 00:15:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 397 transitions. [2018-01-30 00:15:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-30 00:15:11,995 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:11,996 INFO L350 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-30 00:15:11,996 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-30 00:15:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1937156981, now seen corresponding path program 2 times [2018-01-30 00:15:11,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:11,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:11,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:11,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:12,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:12,661 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-30 00:15:12,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:12,662 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-30 00:15:12,667 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:15:12,679 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:12,689 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:15:12,692 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:15:12,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:12,699 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-30 00:15:12,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:12,713 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-30 00:15:12,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:12,715 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-30 00:15:12,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:12,728 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-30 00:15:12,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:12,740 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-30 00:15:12,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-30 00:15:13,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:13,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:13,647 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-30 00:15:13,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:13,777 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-30 00:15:13,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:13,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:13,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:13,814 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-30 00:15:13,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:13,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:13,849 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-30 00:15:13,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:13,886 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-30 00:15:13,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-30 00:15:16,409 WARN L143 SmtUtils]: Spent 412ms on a formula simplification that was a NOOP. DAG size: 60 [2018-01-30 00:15:20,546 WARN L143 SmtUtils]: Spent 2042ms on a formula simplification that was a NOOP. DAG size: 63 [2018-01-30 00:15:21,000 WARN L143 SmtUtils]: Spent 271ms on a formula simplification that was a NOOP. DAG size: 63 [2018-01-30 00:15:21,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-30 00:15:21,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:21,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,204 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-30 00:15:21,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:15:21,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,374 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-30 00:15:21,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:21,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,378 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-30 00:15:21,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:21,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,528 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-30 00:15:21,529 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-30 00:15:21,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,700 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-30 00:15:21,700 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:21,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:21,880 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-30 00:15:21,881 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-30 00:15:22,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:22,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:22,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:22,111 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-30 00:15:22,112 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-30 00:15:22,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:22,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:22,357 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-30 00:15:22,357 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:22,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:22,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:22,360 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-30 00:15:22,361 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:22,586 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-30 00:15:22,586 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 32 variables, input treesize:285, output treesize:437 [2018-01-30 00:15:22,888 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-30 00:15:22,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:22,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-30 00:15:22,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-30 00:15:22,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-30 00:15:22,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1300, Unknown=8, NotChecked=0, Total=1406 [2018-01-30 00:15:22,909 INFO L87 Difference]: Start difference. First operand 349 states and 397 transitions. Second operand 38 states. [2018-01-30 00:15:27,206 WARN L146 SmtUtils]: Spent 4071ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-01-30 00:15:27,459 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 76 DAG size of output 67 [2018-01-30 00:15:33,568 WARN L146 SmtUtils]: Spent 6061ms on a formula simplification. DAG size of input: 52 DAG size of output 51 Received shutdown request... [2018-01-30 00:15:37,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:15:37,719 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:15:37,723 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:15:37,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:15:37 BoogieIcfgContainer [2018-01-30 00:15:37,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:15:37,724 INFO L168 Benchmark]: Toolchain (without parser) took 142948.63 ms. Allocated memory was 303.6 MB in the beginning and 585.1 MB in the end (delta: 281.5 MB). Free memory was 262.4 MB in the beginning and 315.1 MB in the end (delta: -52.6 MB). Peak memory consumption was 228.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:37,725 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:15:37,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.37 ms. Allocated memory is still 303.6 MB. Free memory was 262.4 MB in the beginning and 248.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:37,725 INFO L168 Benchmark]: Boogie Preprocessor took 43.49 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 246.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:37,726 INFO L168 Benchmark]: RCFGBuilder took 406.71 ms. Allocated memory is still 303.6 MB. Free memory was 246.5 MB in the beginning and 219.5 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:37,726 INFO L168 Benchmark]: TraceAbstraction took 142270.38 ms. Allocated memory was 303.6 MB in the beginning and 585.1 MB in the end (delta: 281.5 MB). Free memory was 219.5 MB in the beginning and 315.1 MB in the end (delta: -95.5 MB). Peak memory consumption was 186.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:15:37,727 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.12 ms. Allocated memory is still 303.6 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.37 ms. Allocated memory is still 303.6 MB. Free memory was 262.4 MB in the beginning and 248.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.49 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 246.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 406.71 ms. Allocated memory is still 303.6 MB. Free memory was 246.5 MB in the beginning and 219.5 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 142270.38 ms. Allocated memory was 303.6 MB in the beginning and 585.1 MB in the end (delta: 281.5 MB). Free memory was 219.5 MB in the beginning and 315.1 MB in the end (delta: -95.5 MB). Peak memory consumption was 186.0 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 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - 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 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 7 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 113 locations, 17 error locations. TIMEOUT Result, 142.2s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 119.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2645 SDtfs, 3671 SDslu, 18570 SDs, 0 SdLazy, 9624 SolverSat, 455 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 28.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1692 GetRequests, 1117 SyntacticMatches, 24 SemanticMatches, 550 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3701 ImplicationChecksByTransitivity, 100.9s 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.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 621 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.9s 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-30_00-15-37-736.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-30_00-15-37-736.csv Completed graceful shutdown