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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:48:56,696 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:48:56,697 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:48:56,709 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:48:56,709 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:48:56,709 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:48:56,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:48:56,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:48:56,713 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:48:56,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:48:56,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:48:56,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:48:56,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:48:56,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:48:56,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:48:56,718 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:48:56,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:48:56,721 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:48:56,722 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:48:56,723 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:48:56,725 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:48:56,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:48:56,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:48:56,726 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:48:56,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:48:56,727 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:48:56,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:48:56,728 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:48:56,728 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:48:56,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:48:56,729 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:48:56,729 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:48:56,738 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:48:56,738 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:48:56,739 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:48:56,739 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:48:56,739 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:48:56,739 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:48:56,740 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:48:56,740 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:48:56,740 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:48:56,740 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:48:56,740 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:48:56,740 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:48:56,741 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:48:56,741 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:48:56,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:48:56,741 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:48:56,741 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:48:56,741 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:48:56,741 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:48:56,742 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:48:56,742 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:48:56,742 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:48:56,742 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:48:56,742 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:48:56,742 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:48:56,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:48:56,778 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:48:56,780 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:48:56,781 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:48:56,781 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:48:56,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-04 00:48:56,922 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:48:56,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:48:56,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:48:56,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:48:56,927 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:48:56,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:48:56" (1/1) ... [2018-02-04 00:48:56,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f4e9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:56, skipping insertion in model container [2018-02-04 00:48:56,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:48:56" (1/1) ... [2018-02-04 00:48:56,939 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:48:56,972 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:48:57,063 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:48:57,077 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:48:57,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:57 WrapperNode [2018-02-04 00:48:57,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:48:57,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:48:57,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:48:57,082 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:48:57,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:57" (1/1) ... [2018-02-04 00:48:57,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:57" (1/1) ... [2018-02-04 00:48:57,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:57" (1/1) ... [2018-02-04 00:48:57,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:57" (1/1) ... [2018-02-04 00:48:57,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:57" (1/1) ... [2018-02-04 00:48:57,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:57" (1/1) ... [2018-02-04 00:48:57,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:57" (1/1) ... [2018-02-04 00:48:57,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:48:57,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:48:57,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:48:57,108 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:48:57,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:57" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 00:48:57,140 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:48:57,141 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:48:57,141 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-02-04 00:48:57,141 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:48:57,141 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 00:48:57,141 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 00:48:57,141 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:48:57,141 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:48:57,142 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:48:57,142 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:48:57,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:48:57,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:48:57,142 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:48:57,142 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:48:57,142 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:48:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:48:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-02-04 00:48:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:48:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-04 00:48:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 00:48:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 00:48:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:48:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:48:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:48:57,144 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:48:57,351 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:48:57,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:48:57 BoogieIcfgContainer [2018-02-04 00:48:57,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:48:57,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:48:57,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:48:57,353 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:48:57,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:48:56" (1/3) ... [2018-02-04 00:48:57,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73942f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:48:57, skipping insertion in model container [2018-02-04 00:48:57,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:48:57" (2/3) ... [2018-02-04 00:48:57,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73942f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:48:57, skipping insertion in model container [2018-02-04 00:48:57,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:48:57" (3/3) ... [2018-02-04 00:48:57,356 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-04 00:48:57,362 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:48:57,367 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 00:48:57,397 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:48:57,397 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:48:57,398 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:48:57,398 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:48:57,398 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:48:57,398 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:48:57,398 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:48:57,398 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:48:57,399 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:48:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-02-04 00:48:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:48:57,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:48:57,419 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:48:57,419 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-02-04 00:48:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-02-04 00:48:57,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:48:57,425 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:48:57,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:57,472 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:48:57,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:48:57,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:48:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:48:57,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:48:57,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:48:57,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:48:57,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:48:57,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:48:57,656 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-02-04 00:48:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:48:57,783 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-02-04 00:48:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:48:57,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-04 00:48:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:48:57,793 INFO L225 Difference]: With dead ends: 133 [2018-02-04 00:48:57,793 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 00:48:57,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:48:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 00:48:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-02-04 00:48:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 00:48:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-02-04 00:48:57,826 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-02-04 00:48:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:48:57,826 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-02-04 00:48:57,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:48:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-02-04 00:48:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:48:57,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:48:57,828 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:48:57,828 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-02-04 00:48:57,828 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-02-04 00:48:57,828 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:48:57,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:48:57,829 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:57,830 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:48:57,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:48:57,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:48:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:48:57,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:48:57,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:48:57,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:48:57,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:48:57,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:48:57,892 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-02-04 00:48:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:48:57,906 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-04 00:48:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:48:57,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 00:48:57,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:48:57,907 INFO L225 Difference]: With dead ends: 85 [2018-02-04 00:48:57,907 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 00:48:57,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:48:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 00:48:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 00:48:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 00:48:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-04 00:48:57,912 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-02-04 00:48:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:48:57,912 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-04 00:48:57,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:48:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-04 00:48:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 00:48:57,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:48:57,913 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:48:57,913 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-02-04 00:48:57,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-02-04 00:48:57,913 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:48:57,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:48:57,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:57,914 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:48:57,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:48:57,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:48:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:48:57,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:48:57,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:48:57,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:48:57,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:48:57,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:48:57,955 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-04 00:48:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:48:58,000 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-04 00:48:58,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:48:58,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 00:48:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:48:58,001 INFO L225 Difference]: With dead ends: 81 [2018-02-04 00:48:58,001 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 00:48:58,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:48:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 00:48:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 00:48:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 00:48:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 00:48:58,007 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-02-04 00:48:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:48:58,007 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 00:48:58,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:48:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 00:48:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 00:48:58,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:48:58,008 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:48:58,008 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-02-04 00:48:58,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-02-04 00:48:58,008 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:48:58,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:48:58,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:58,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:48:58,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:48:58,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:48:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:48:58,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:48:58,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:48:58,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:48:58,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:48:58,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:48:58,066 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-02-04 00:48:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:48:58,145 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 00:48:58,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:48:58,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 00:48:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:48:58,145 INFO L225 Difference]: With dead ends: 80 [2018-02-04 00:48:58,145 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 00:48:58,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:48:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 00:48:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 00:48:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 00:48:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-04 00:48:58,150 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-02-04 00:48:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:48:58,151 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-04 00:48:58,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:48:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-04 00:48:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 00:48:58,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:48:58,152 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:48:58,152 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-02-04 00:48:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-02-04 00:48:58,152 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:48:58,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:48:58,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:58,154 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:48:58,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:48:58,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:48:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:48:58,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:48:58,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 00:48:58,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:48:58,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:48:58,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:48:58,383 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-02-04 00:48:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:48:58,564 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-02-04 00:48:58,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:48:58,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-04 00:48:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:48:58,566 INFO L225 Difference]: With dead ends: 84 [2018-02-04 00:48:58,566 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 00:48:58,567 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:48:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 00:48:58,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-04 00:48:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 00:48:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-04 00:48:58,570 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-02-04 00:48:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:48:58,570 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-04 00:48:58,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:48:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-04 00:48:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 00:48:58,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:48:58,570 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:48:58,570 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-02-04 00:48:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-02-04 00:48:58,574 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:48:58,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:48:58,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:58,575 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:48:58,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:48:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:48:58,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:48:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:48:58,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:48:58,811 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:48:58,816 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:48:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:48:58,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:48:58,917 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-02-04 00:48:58,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:48:58,931 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-02-04 00:48:58,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:48:58,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:48:58,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 00:48:59,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:48:59,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:48:59,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-02-04 00:48:59,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 00:48:59,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 00:48:59,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:48:59,264 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 20 states. [2018-02-04 00:49:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:02,260 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-04 00:49:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:49:02,261 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-02-04 00:49:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:02,261 INFO L225 Difference]: With dead ends: 83 [2018-02-04 00:49:02,261 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 00:49:02,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:49:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 00:49:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 00:49:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 00:49:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 00:49:02,266 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 29 [2018-02-04 00:49:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:02,267 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 00:49:02,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 00:49:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 00:49:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 00:49:02,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:02,268 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 00:49:02,268 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-02-04 00:49:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1224527730, now seen corresponding path program 1 times [2018-02-04 00:49:02,268 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:02,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:02,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:02,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:02,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:02,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:49:02,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:02,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:49:02,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:49:02,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:49:02,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:49:02,320 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-02-04 00:49:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:02,345 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-04 00:49:02,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:49:02,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-04 00:49:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:02,347 INFO L225 Difference]: With dead ends: 85 [2018-02-04 00:49:02,347 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 00:49:02,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:49:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 00:49:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-02-04 00:49:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 00:49:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-04 00:49:02,351 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-02-04 00:49:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:02,352 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-04 00:49:02,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:49:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-04 00:49:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:49:02,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:02,353 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:02,353 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-02-04 00:49:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash 755727615, now seen corresponding path program 1 times [2018-02-04 00:49:02,353 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:02,353 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:02,354 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:02,354 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:02,354 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:02,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:02,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:02,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:49:02,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:49:02,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:49:02,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:49:02,392 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-02-04 00:49:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:02,527 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-02-04 00:49:02,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:49:02,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-04 00:49:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:02,532 INFO L225 Difference]: With dead ends: 126 [2018-02-04 00:49:02,532 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 00:49:02,533 INFO L554 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-02-04 00:49:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 00:49:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-02-04 00:49:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 00:49:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-04 00:49:02,538 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 41 [2018-02-04 00:49:02,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:02,539 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-04 00:49:02,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:49:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-04 00:49:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:49:02,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:02,540 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:02,540 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-02-04 00:49:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash 755727616, now seen corresponding path program 1 times [2018-02-04 00:49:02,540 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:02,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:02,541 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:02,541 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:02,541 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:02,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:49:02,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:02,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:49:02,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:49:02,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:49:02,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:49:02,592 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 7 states. [2018-02-04 00:49:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:02,634 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-02-04 00:49:02,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:49:02,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-04 00:49:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:02,635 INFO L225 Difference]: With dead ends: 133 [2018-02-04 00:49:02,635 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 00:49:02,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:49:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 00:49:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2018-02-04 00:49:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 00:49:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2018-02-04 00:49:02,638 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 41 [2018-02-04 00:49:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:02,638 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-02-04 00:49:02,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:49:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2018-02-04 00:49:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:49:02,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:02,639 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:02,639 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-02-04 00:49:02,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386836, now seen corresponding path program 1 times [2018-02-04 00:49:02,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:02,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:02,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:02,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:02,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:02,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:49:02,745 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:49:02,745 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:49:02,752 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:02,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:49:02,785 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-02-04 00:49:02,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:02,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:49:02,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:49:02,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:02,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:02,833 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-02-04 00:49:02,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:02,841 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-02-04 00:49:02,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 00:49:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:49:02,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:49:02,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-02-04 00:49:02,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:49:02,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:49:02,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:49:02,895 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand 13 states. [2018-02-04 00:49:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:03,523 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2018-02-04 00:49:03,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:49:03,523 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-02-04 00:49:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:03,524 INFO L225 Difference]: With dead ends: 153 [2018-02-04 00:49:03,525 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 00:49:03,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:49:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 00:49:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 112. [2018-02-04 00:49:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 00:49:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2018-02-04 00:49:03,532 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 42 [2018-02-04 00:49:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:03,533 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2018-02-04 00:49:03,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:49:03,533 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2018-02-04 00:49:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:49:03,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:03,533 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:03,534 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-02-04 00:49:03,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386837, now seen corresponding path program 1 times [2018-02-04 00:49:03,534 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:03,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:03,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:03,535 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:03,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:03,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:03,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:49:03,684 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:49:03,689 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:03,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:49:03,709 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-02-04 00:49:03,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:03,720 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-02-04 00:49:03,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:03,731 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-02-04 00:49:03,731 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:03,732 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-02-04 00:49:03,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:03,742 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-02-04 00:49:03,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-02-04 00:49:04,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:04,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:04,046 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-02-04 00:49:04,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:04,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:04,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:04,106 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-02-04 00:49:04,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:04,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:04,133 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-02-04 00:49:04,133 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:04,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:04,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:04,160 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-02-04 00:49:04,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:04,181 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-02-04 00:49:04,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:101, output treesize:83 [2018-02-04 00:49:04,336 WARN L143 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 47 [2018-02-04 00:49:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:04,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:49:04,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-04 00:49:04,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:49:04,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:49:04,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=453, Unknown=3, NotChecked=0, Total=506 [2018-02-04 00:49:04,376 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 23 states. [2018-02-04 00:49:08,163 WARN L146 SmtUtils]: Spent 3670ms on a formula simplification. DAG size of input: 55 DAG size of output 54 [2018-02-04 00:49:14,047 WARN L146 SmtUtils]: Spent 5850ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-02-04 00:49:15,888 WARN L146 SmtUtils]: Spent 1808ms on a formula simplification. DAG size of input: 53 DAG size of output 52 [2018-02-04 00:49:19,669 WARN L146 SmtUtils]: Spent 3743ms on a formula simplification. DAG size of input: 53 DAG size of output 52 [2018-02-04 00:49:21,561 WARN L146 SmtUtils]: Spent 1858ms on a formula simplification. DAG size of input: 55 DAG size of output 54 [2018-02-04 00:49:50,084 WARN L146 SmtUtils]: Spent 20992ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-02-04 00:50:12,776 WARN L146 SmtUtils]: Spent 22642ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-02-04 00:50:34,254 WARN L146 SmtUtils]: Spent 20414ms on a formula simplification. DAG size of input: 60 DAG size of output 57 [2018-02-04 00:50:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:34,400 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2018-02-04 00:50:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 00:50:34,400 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-02-04 00:50:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:34,401 INFO L225 Difference]: With dead ends: 202 [2018-02-04 00:50:34,401 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 00:50:34,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 82.7s TimeCoverageRelationStatistics Valid=162, Invalid=1162, Unknown=8, NotChecked=0, Total=1332 [2018-02-04 00:50:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 00:50:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 116. [2018-02-04 00:50:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 00:50:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-02-04 00:50:34,406 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 42 [2018-02-04 00:50:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:34,406 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-02-04 00:50:34,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:50:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-02-04 00:50:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 00:50:34,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:34,407 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:34,408 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-02-04 00:50:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1548167688, now seen corresponding path program 1 times [2018-02-04 00:50:34,408 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:34,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:34,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:34,409 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:34,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:34,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:50:34,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:50:34,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:50:34,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:50:34,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:50:34,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:50:34,437 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 4 states. [2018-02-04 00:50:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:34,459 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-04 00:50:34,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:50:34,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-04 00:50:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:34,460 INFO L225 Difference]: With dead ends: 125 [2018-02-04 00:50:34,460 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 00:50:34,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:50:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 00:50:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2018-02-04 00:50:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 00:50:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2018-02-04 00:50:34,465 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 43 [2018-02-04 00:50:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:34,465 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2018-02-04 00:50:34,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:50:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2018-02-04 00:50:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 00:50:34,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:34,467 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:34,467 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-02-04 00:50:34,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1943737008, now seen corresponding path program 1 times [2018-02-04 00:50:34,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:34,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:34,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:34,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:34,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:34,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:50:34,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:34,561 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:34,572 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:34,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:34,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 00:50:34,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:34,619 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-02-04 00:50:34,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:34,631 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-02-04 00:50:34,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-02-04 00:50:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:50:34,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:34,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-02-04 00:50:34,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 00:50:34,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 00:50:34,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-04 00:50:34,994 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 18 states. [2018-02-04 00:50:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:45,958 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2018-02-04 00:50:45,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:50:45,958 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-02-04 00:50:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:45,959 INFO L225 Difference]: With dead ends: 141 [2018-02-04 00:50:45,959 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 00:50:45,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2018-02-04 00:50:45,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 00:50:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2018-02-04 00:50:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 00:50:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2018-02-04 00:50:45,962 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 51 [2018-02-04 00:50:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:45,962 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2018-02-04 00:50:45,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 00:50:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-02-04 00:50:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:50:45,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:45,968 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 00:50:45,968 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-02-04 00:50:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash 126305131, now seen corresponding path program 1 times [2018-02-04 00:50:45,969 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:45,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:45,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:45,970 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:45,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:45,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:50:46,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:46,124 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:46,132 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:46,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:46,180 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-02-04 00:50:46,181 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-02-04 00:50:46,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 00:50:46,221 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-02-04 00:50:46,224 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-02-04 00:50:46,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 00:50:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:50:46,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:46,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-02-04 00:50:46,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 00:50:46,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 00:50:46,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:50:46,270 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 17 states. [2018-02-04 00:50:46,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:46,648 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-02-04 00:50:46,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 00:50:46,648 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-04 00:50:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:46,649 INFO L225 Difference]: With dead ends: 164 [2018-02-04 00:50:46,649 INFO L226 Difference]: Without dead ends: 164 [2018-02-04 00:50:46,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2018-02-04 00:50:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-04 00:50:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-02-04 00:50:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 00:50:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2018-02-04 00:50:46,654 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 52 [2018-02-04 00:50:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:46,654 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2018-02-04 00:50:46,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 00:50:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2018-02-04 00:50:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:50:46,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:46,655 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 00:50:46,655 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-02-04 00:50:46,655 INFO L82 PathProgramCache]: Analyzing trace with hash 126305132, now seen corresponding path program 1 times [2018-02-04 00:50:46,655 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:46,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:46,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:46,656 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:46,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:46,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:50:46,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:46,783 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:46,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:46,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:46,819 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-02-04 00:50:46,820 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-02-04 00:50:46,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 00:50:46,852 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-02-04 00:50:46,853 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-02-04 00:50:46,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:46,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 00:50:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:50:46,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:46,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-02-04 00:50:46,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 00:50:46,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 00:50:46,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:50:46,877 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand 17 states. [2018-02-04 00:50:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:47,175 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2018-02-04 00:50:47,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:50:47,175 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-04 00:50:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:47,176 INFO L225 Difference]: With dead ends: 163 [2018-02-04 00:50:47,176 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 00:50:47,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-04 00:50:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 00:50:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2018-02-04 00:50:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 00:50:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2018-02-04 00:50:47,181 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 52 [2018-02-04 00:50:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:47,181 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2018-02-04 00:50:47,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 00:50:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2018-02-04 00:50:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 00:50:47,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:47,182 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:47,182 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-02-04 00:50:47,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2101833613, now seen corresponding path program 1 times [2018-02-04 00:50:47,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:47,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:47,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:47,184 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:47,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:47,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 00:50:47,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:50:47,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:50:47,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:50:47,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:50:47,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:50:47,220 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 6 states. [2018-02-04 00:50:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:47,239 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-04 00:50:47,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:50:47,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-02-04 00:50:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:47,240 INFO L225 Difference]: With dead ends: 125 [2018-02-04 00:50:47,240 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 00:50:47,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:50:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 00:50:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-04 00:50:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 00:50:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2018-02-04 00:50:47,242 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 53 [2018-02-04 00:50:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:47,242 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2018-02-04 00:50:47,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:50:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2018-02-04 00:50:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 00:50:47,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:47,243 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 00:50:47,243 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-02-04 00:50:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1018243012, now seen corresponding path program 1 times [2018-02-04 00:50:47,243 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:47,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:47,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:47,244 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:47,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:47,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 00:50:47,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:47,286 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:47,293 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:47,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 00:50:47,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:47,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 00:50:47,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:50:47,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:50:47,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:50:47,351 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand 7 states. [2018-02-04 00:50:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:47,441 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2018-02-04 00:50:47,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:50:47,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-02-04 00:50:47,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:47,442 INFO L225 Difference]: With dead ends: 142 [2018-02-04 00:50:47,442 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 00:50:47,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:50:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 00:50:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-02-04 00:50:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 00:50:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2018-02-04 00:50:47,445 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 54 [2018-02-04 00:50:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:47,445 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2018-02-04 00:50:47,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:50:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2018-02-04 00:50:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 00:50:47,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:47,446 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 00:50:47,446 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-02-04 00:50:47,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1018243011, now seen corresponding path program 1 times [2018-02-04 00:50:47,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:47,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:47,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:47,447 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:47,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:47,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 00:50:47,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:47,619 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:47,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:47,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:50:47,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:47,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 20 [2018-02-04 00:50:47,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:50:47,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:50:47,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:50:47,791 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 21 states. [2018-02-04 00:50:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:48,391 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2018-02-04 00:50:48,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:50:48,392 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-02-04 00:50:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:48,392 INFO L225 Difference]: With dead ends: 163 [2018-02-04 00:50:48,392 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 00:50:48,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2018-02-04 00:50:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 00:50:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2018-02-04 00:50:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 00:50:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-02-04 00:50:48,395 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 54 [2018-02-04 00:50:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:48,395 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-02-04 00:50:48,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:50:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-02-04 00:50:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 00:50:48,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:48,396 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:48,396 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-02-04 00:50:48,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1500762242, now seen corresponding path program 1 times [2018-02-04 00:50:48,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:48,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:48,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:48,397 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:48,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:48,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:50:48,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:48,797 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:48,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:48,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:48,863 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-02-04 00:50:48,864 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-02-04 00:50:48,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:48,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:48,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:48,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 00:50:48,908 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-02-04 00:50:48,909 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-02-04 00:50:48,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:48,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:48,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:48,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 00:50:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 00:50:48,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:48,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 26 [2018-02-04 00:50:48,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 00:50:48,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 00:50:48,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:50:48,937 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 27 states. [2018-02-04 00:50:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:49,279 INFO L93 Difference]: Finished difference Result 336 states and 410 transitions. [2018-02-04 00:50:49,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:50:49,280 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2018-02-04 00:50:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:49,281 INFO L225 Difference]: With dead ends: 336 [2018-02-04 00:50:49,281 INFO L226 Difference]: Without dead ends: 336 [2018-02-04 00:50:49,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 00:50:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-04 00:50:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 214. [2018-02-04 00:50:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 00:50:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 268 transitions. [2018-02-04 00:50:49,291 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 268 transitions. Word has length 55 [2018-02-04 00:50:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:49,291 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 268 transitions. [2018-02-04 00:50:49,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 00:50:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 268 transitions. [2018-02-04 00:50:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 00:50:49,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:49,292 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:49,292 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-02-04 00:50:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1500762241, now seen corresponding path program 1 times [2018-02-04 00:50:49,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:49,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:49,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:49,294 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:49,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:49,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:50:49,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:49,774 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:49,779 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:49,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:49,818 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-02-04 00:50:49,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:49,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:49,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:50:49,854 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-02-04 00:50:49,855 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-02-04 00:50:49,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:49,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:49,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:49,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 00:50:49,914 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-02-04 00:50:49,915 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-02-04 00:50:49,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:49,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:49,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:49,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-04 00:50:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 00:50:49,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:49,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 28 [2018-02-04 00:50:49,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 00:50:49,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 00:50:49,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2018-02-04 00:50:49,937 INFO L87 Difference]: Start difference. First operand 214 states and 268 transitions. Second operand 29 states. [2018-02-04 00:50:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:50,320 INFO L93 Difference]: Finished difference Result 249 states and 324 transitions. [2018-02-04 00:50:50,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 00:50:50,320 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-02-04 00:50:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:50,321 INFO L225 Difference]: With dead ends: 249 [2018-02-04 00:50:50,321 INFO L226 Difference]: Without dead ends: 249 [2018-02-04 00:50:50,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 00:50:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-04 00:50:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 195. [2018-02-04 00:50:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 00:50:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 242 transitions. [2018-02-04 00:50:50,325 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 242 transitions. Word has length 55 [2018-02-04 00:50:50,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:50,325 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 242 transitions. [2018-02-04 00:50:50,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 00:50:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 242 transitions. [2018-02-04 00:50:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 00:50:50,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:50,326 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:50,326 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-02-04 00:50:50,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2012095048, now seen corresponding path program 1 times [2018-02-04 00:50:50,326 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:50,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:50,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:50,327 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:50,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:50,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 00:50:50,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:50,423 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:50,427 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:50,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:50:50,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:50,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-02-04 00:50:50,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:50:50,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:50:50,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:50:50,531 INFO L87 Difference]: Start difference. First operand 195 states and 242 transitions. Second operand 19 states. [2018-02-04 00:50:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:50,680 INFO L93 Difference]: Finished difference Result 230 states and 282 transitions. [2018-02-04 00:50:50,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:50:50,683 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-04 00:50:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:50,685 INFO L225 Difference]: With dead ends: 230 [2018-02-04 00:50:50,685 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 00:50:50,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:50:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 00:50:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 219. [2018-02-04 00:50:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 00:50:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2018-02-04 00:50:50,690 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 55 [2018-02-04 00:50:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:50,691 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2018-02-04 00:50:50,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:50:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2018-02-04 00:50:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 00:50:50,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:50,691 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 00:50:50,692 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-02-04 00:50:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1345976352, now seen corresponding path program 1 times [2018-02-04 00:50:50,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:50,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:50,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:50,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:50,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:50,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:50:50,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:50:50,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:50:50,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:50:50,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:50:50,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:50:50,745 INFO L87 Difference]: Start difference. First operand 219 states and 269 transitions. Second operand 7 states. [2018-02-04 00:50:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:50,779 INFO L93 Difference]: Finished difference Result 233 states and 279 transitions. [2018-02-04 00:50:50,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:50:50,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-02-04 00:50:50,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:50,783 INFO L225 Difference]: With dead ends: 233 [2018-02-04 00:50:50,783 INFO L226 Difference]: Without dead ends: 221 [2018-02-04 00:50:50,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:50:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-04 00:50:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2018-02-04 00:50:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 00:50:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 250 transitions. [2018-02-04 00:50:50,788 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 250 transitions. Word has length 56 [2018-02-04 00:50:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:50,789 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 250 transitions. [2018-02-04 00:50:50,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:50:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 250 transitions. [2018-02-04 00:50:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 00:50:50,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:50,790 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:50,790 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-02-04 00:50:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1550179515, now seen corresponding path program 1 times [2018-02-04 00:50:50,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:50,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:50,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:50,791 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:50,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:50,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:50:50,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:50,891 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:50,899 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:50,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:50:50,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:50,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-02-04 00:50:50,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:50:50,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:50:50,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:50:50,993 INFO L87 Difference]: Start difference. First operand 206 states and 250 transitions. Second operand 19 states. [2018-02-04 00:50:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:51,064 INFO L93 Difference]: Finished difference Result 225 states and 269 transitions. [2018-02-04 00:50:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:50:51,065 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-02-04 00:50:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:51,065 INFO L225 Difference]: With dead ends: 225 [2018-02-04 00:50:51,065 INFO L226 Difference]: Without dead ends: 225 [2018-02-04 00:50:51,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:50:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-04 00:50:51,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2018-02-04 00:50:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 00:50:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 263 transitions. [2018-02-04 00:50:51,070 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 263 transitions. Word has length 57 [2018-02-04 00:50:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:51,070 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 263 transitions. [2018-02-04 00:50:51,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:50:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 263 transitions. [2018-02-04 00:50:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 00:50:51,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:51,071 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:51,071 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-02-04 00:50:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash 631093502, now seen corresponding path program 1 times [2018-02-04 00:50:51,072 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:51,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:51,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:51,073 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:51,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:51,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:50:51,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:51,531 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:51,539 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:51,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:51,570 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-02-04 00:50:51,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:50:51,636 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-02-04 00:50:51,637 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-02-04 00:50:51,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-02-04 00:50:51,660 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-02-04 00:50:51,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,663 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-02-04 00:50:51,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:11 [2018-02-04 00:50:51,866 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-02-04 00:50:51,868 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-02-04 00:50:51,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,875 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-02-04 00:50:51,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,880 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-02-04 00:50:51,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:51,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:20, output treesize:5 [2018-02-04 00:50:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:50:51,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:51,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 25 [2018-02-04 00:50:51,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 00:50:51,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 00:50:51,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-02-04 00:50:51,904 INFO L87 Difference]: Start difference. First operand 219 states and 263 transitions. Second operand 26 states. [2018-02-04 00:50:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:52,626 INFO L93 Difference]: Finished difference Result 305 states and 371 transitions. [2018-02-04 00:50:52,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:50:52,627 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-02-04 00:50:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:52,628 INFO L225 Difference]: With dead ends: 305 [2018-02-04 00:50:52,628 INFO L226 Difference]: Without dead ends: 305 [2018-02-04 00:50:52,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=1516, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 00:50:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-04 00:50:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-02-04 00:50:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-04 00:50:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 307 transitions. [2018-02-04 00:50:52,636 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 307 transitions. Word has length 59 [2018-02-04 00:50:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:52,636 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 307 transitions. [2018-02-04 00:50:52,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 00:50:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 307 transitions. [2018-02-04 00:50:52,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 00:50:52,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:52,637 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:52,637 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-02-04 00:50:52,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1742435855, now seen corresponding path program 2 times [2018-02-04 00:50:52,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:52,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:52,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:52,638 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:52,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:52,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 00:50:52,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:52,997 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:50:53,005 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:50:53,028 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:50:53,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:50:53,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:53,036 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-02-04 00:50:53,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:53,047 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-02-04 00:50:53,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:53,049 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-02-04 00:50:53,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:53,060 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-02-04 00:50:53,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:53,070 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-02-04 00:50:53,070 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-02-04 00:50:53,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:53,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:53,625 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-02-04 00:50:53,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:53,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:53,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:53,657 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 57 treesize of output 70 [2018-02-04 00:50:53,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:53,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:53,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:53,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-02-04 00:50:53,716 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:53,745 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-02-04 00:50:53,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:53,770 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-02-04 00:50:53,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-02-04 00:50:55,862 WARN L143 SmtUtils]: Spent 2041ms on a formula simplification that was a NOOP. DAG size: 60 [2018-02-04 00:50:57,969 WARN L143 SmtUtils]: Spent 2035ms on a formula simplification that was a NOOP. DAG size: 63 [2018-02-04 00:50:58,185 WARN L143 SmtUtils]: Spent 155ms on a formula simplification that was a NOOP. DAG size: 63 [2018-02-04 00:50:58,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:58,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:58,261 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-02-04 00:50:58,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:58,387 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:58,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:58,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:58,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:58,397 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 71 treesize of output 102 [2018-02-04 00:50:58,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 00:50:58,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:58,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:58,555 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 71 treesize of output 65 [2018-02-04 00:50:58,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:58,681 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 65 treesize of output 68 [2018-02-04 00:50:58,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 00:50:58,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:58,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:58,943 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 69 treesize of output 63 [2018-02-04 00:50:58,944 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:59,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:59,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:59,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:59,168 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 63 treesize of output 90 [2018-02-04 00:50:59,169 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 00:50:59,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:59,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:59,386 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-02-04 00:50:59,387 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 00:50:59,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:59,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:59,584 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 70 treesize of output 64 [2018-02-04 00:50:59,584 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:59,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:59,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:59,586 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 64 treesize of output 58 [2018-02-04 00:50:59,587 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:59,769 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-02-04 00:50:59,770 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 32 variables, input treesize:285, output treesize:437 [2018-02-04 00:51:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:51:00,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:51:00,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2018-02-04 00:51:00,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 00:51:00,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 00:51:00,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1033, Unknown=2, NotChecked=0, Total=1122 [2018-02-04 00:51:00,029 INFO L87 Difference]: Start difference. First operand 260 states and 307 transitions. Second operand 34 states. [2018-02-04 00:51:04,243 WARN L146 SmtUtils]: Spent 4065ms on a formula simplification. DAG size of input: 54 DAG size of output 53 [2018-02-04 00:51:06,379 WARN L146 SmtUtils]: Spent 2098ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-02-04 00:51:08,541 WARN L146 SmtUtils]: Spent 2039ms on a formula simplification. DAG size of input: 52 DAG size of output 49 [2018-02-04 00:51:09,541 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 36 DAG size of output 34 [2018-02-04 00:51:10,651 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 58 DAG size of output 52 [2018-02-04 00:51:40,068 WARN L146 SmtUtils]: Spent 28734ms on a formula simplification. DAG size of input: 82 DAG size of output 81 [2018-02-04 00:52:12,830 WARN L146 SmtUtils]: Spent 32714ms on a formula simplification. DAG size of input: 88 DAG size of output 84 Received shutdown request... [2018-02-04 00:52:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:52:33,977 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 00:52:33,980 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 00:52:33,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:52:33 BoogieIcfgContainer [2018-02-04 00:52:33,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:52:33,981 INFO L168 Benchmark]: Toolchain (without parser) took 217058.75 ms. Allocated memory was 400.0 MB in the beginning and 711.5 MB in the end (delta: 311.4 MB). Free memory was 354.0 MB in the beginning and 441.1 MB in the end (delta: -87.1 MB). Peak memory consumption was 224.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:52:33,981 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:52:33,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.05 ms. Allocated memory is still 400.0 MB. Free memory was 354.0 MB in the beginning and 340.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:52:33,982 INFO L168 Benchmark]: Boogie Preprocessor took 25.55 ms. Allocated memory is still 400.0 MB. Free memory was 340.8 MB in the beginning and 339.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-04 00:52:33,982 INFO L168 Benchmark]: RCFGBuilder took 243.25 ms. Allocated memory is still 400.0 MB. Free memory was 338.1 MB in the beginning and 312.8 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:52:33,982 INFO L168 Benchmark]: TraceAbstraction took 216628.65 ms. Allocated memory was 400.0 MB in the beginning and 711.5 MB in the end (delta: 311.4 MB). Free memory was 312.8 MB in the beginning and 441.1 MB in the end (delta: -128.3 MB). Peak memory consumption was 183.1 MB. Max. memory is 5.3 GB. [2018-02-04 00:52:33,983 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.05 ms. Allocated memory is still 400.0 MB. Free memory was 354.0 MB in the beginning and 340.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.55 ms. Allocated memory is still 400.0 MB. Free memory was 340.8 MB in the beginning and 339.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 243.25 ms. Allocated memory is still 400.0 MB. Free memory was 338.1 MB in the beginning and 312.8 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 216628.65 ms. Allocated memory was 400.0 MB in the beginning and 711.5 MB in the end (delta: 311.4 MB). Free memory was 312.8 MB in the beginning and 441.1 MB in the end (delta: -128.3 MB). Peak memory consumption was 183.1 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 (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (260states) and interpolant automaton (currently 26 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 90. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 82 locations, 17 error locations. TIMEOUT Result, 216.5s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 202.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1917 SDtfs, 2160 SDslu, 13146 SDs, 0 SdLazy, 9120 SolverSat, 535 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 25.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1151 GetRequests, 671 SyntacticMatches, 20 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 164.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred 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.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 560 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 1827 NumberOfCodeBlocks, 1827 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1788 ConstructedInterpolants, 110 QuantifiedInterpolants, 617653 SizeOfPredicates, 95 NumberOfNonLiveVariables, 2621 ConjunctsInSsa, 335 ConjunctsInUnsatCore, 39 InterpolantComputations, 11 PerfectInterpolantSequences, 209/334 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-52-33-988.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-52-33-988.csv Completed graceful shutdown