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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:22:23,752 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:22:23,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:22:23,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:22:23,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:22:23,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:22:23,767 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:22:23,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:22:23,770 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:22:23,771 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:22:23,772 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:22:23,772 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:22:23,773 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:22:23,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:22:23,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:22:23,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:22:23,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:22:23,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:22:23,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:22:23,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:22:23,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:22:23,783 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:22:23,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:22:23,784 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:22:23,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:22:23,786 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:22:23,786 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:22:23,786 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:22:23,787 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:22:23,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:22:23,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:22:23,787 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:22:23,796 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:22:23,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:22:23,797 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:22:23,797 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:22:23,797 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:22:23,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:22:23,798 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:22:23,798 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:22:23,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:22:23,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:22:23,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:22:23,798 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:22:23,798 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:22:23,798 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:22:23,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:22:23,799 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:22:23,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:22:23,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:22:23,799 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:22:23,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:22:23,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:22:23,799 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:22:23,799 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:22:23,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:22:23,800 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:22:23,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:22:23,839 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:22:23,842 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:22:23,843 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:22:23,843 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:22:23,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-02-02 09:22:23,979 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:22:23,980 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:22:23,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:22:23,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:22:23,985 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:22:23,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:22:23" (1/1) ... [2018-02-02 09:22:23,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8b5bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:23, skipping insertion in model container [2018-02-02 09:22:23,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:22:23" (1/1) ... [2018-02-02 09:22:23,998 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:22:24,034 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:22:24,128 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:22:24,145 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:22:24,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:24 WrapperNode [2018-02-02 09:22:24,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:22:24,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:22:24,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:22:24,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:22:24,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:24" (1/1) ... [2018-02-02 09:22:24,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:24" (1/1) ... [2018-02-02 09:22:24,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:24" (1/1) ... [2018-02-02 09:22:24,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:24" (1/1) ... [2018-02-02 09:22:24,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:24" (1/1) ... [2018-02-02 09:22:24,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:24" (1/1) ... [2018-02-02 09:22:24,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:24" (1/1) ... [2018-02-02 09:22:24,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:22:24,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:22:24,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:22:24,184 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:22:24,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:24" (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-02 09:22:24,227 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:22:24,228 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:22:24,228 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 09:22:24,228 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 09:22:24,228 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 09:22:24,228 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 09:22:24,228 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:22:24,229 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:22:24,229 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:22:24,229 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:22:24,229 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:22:24,229 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:22:24,229 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:22:24,229 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:22:24,229 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:22:24,229 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 09:22:24,230 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 09:22:24,230 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 09:22:24,230 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 09:22:24,230 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:22:24,230 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:22:24,230 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:22:24,451 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:22:24,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:22:24 BoogieIcfgContainer [2018-02-02 09:22:24,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:22:24,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:22:24,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:22:24,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:22:24,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:22:23" (1/3) ... [2018-02-02 09:22:24,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cabad46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:22:24, skipping insertion in model container [2018-02-02 09:22:24,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:24" (2/3) ... [2018-02-02 09:22:24,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cabad46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:22:24, skipping insertion in model container [2018-02-02 09:22:24,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:22:24" (3/3) ... [2018-02-02 09:22:24,456 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-02-02 09:22:24,461 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:22:24,466 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 09:22:24,497 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:22:24,497 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:22:24,497 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:22:24,497 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:22:24,497 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:22:24,498 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:22:24,498 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:22:24,498 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:22:24,498 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:22:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-02-02 09:22:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:22:24,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:24,519 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:22:24,519 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]=== [2018-02-02 09:22:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-02-02 09:22:24,525 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:24,525 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:24,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:24,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:24,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:24,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:24,693 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-02 09:22:24,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:22:24,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:22:24,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:22:24,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:22:24,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:22:24,755 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-02-02 09:22:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:24,879 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2018-02-02 09:22:24,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:22:24,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 09:22:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:24,889 INFO L225 Difference]: With dead ends: 121 [2018-02-02 09:22:24,889 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 09:22:24,891 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-02 09:22:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 09:22:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-02 09:22:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 09:22:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-02-02 09:22:24,927 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-02-02 09:22:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:24,927 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-02-02 09:22:24,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:22:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-02-02 09:22:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:22:24,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:24,928 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:22:24,929 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]=== [2018-02-02 09:22:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-02-02 09:22:24,929 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:24,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:24,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:24,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:24,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:24,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:24,988 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-02 09:22:24,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:22:24,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:22:24,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:22:24,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:22:24,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:22:24,991 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-02-02 09:22:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:25,009 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-02-02 09:22:25,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:22:25,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 09:22:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:25,011 INFO L225 Difference]: With dead ends: 94 [2018-02-02 09:22:25,011 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 09:22:25,012 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-02 09:22:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 09:22:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-02-02 09:22:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 09:22:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-02 09:22:25,018 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-02-02 09:22:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:25,018 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-02 09:22:25,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:22:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-02 09:22:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:22:25,019 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:25,019 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:22:25,019 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]=== [2018-02-02 09:22:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-02-02 09:22:25,019 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:25,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:25,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:25,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:25,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:25,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:25,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-02 09:22:25,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:22:25,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:22:25,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:22:25,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:22:25,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:22:25,066 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-02 09:22:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:25,096 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-02 09:22:25,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:22:25,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 09:22:25,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:25,097 INFO L225 Difference]: With dead ends: 72 [2018-02-02 09:22:25,097 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 09:22:25,098 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-02 09:22:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 09:22:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-02 09:22:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 09:22:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 09:22:25,102 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-02-02 09:22:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:25,103 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 09:22:25,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:22:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 09:22:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:22:25,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:25,104 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:22:25,104 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]=== [2018-02-02 09:22:25,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-02-02 09:22:25,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:25,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:25,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:25,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:25,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:25,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:25,146 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-02 09:22:25,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:22:25,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:22:25,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:22:25,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:22:25,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:22:25,147 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-02 09:22:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:25,258 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-02 09:22:25,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:22:25,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 09:22:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:25,259 INFO L225 Difference]: With dead ends: 71 [2018-02-02 09:22:25,259 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 09:22:25,260 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-02 09:22:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 09:22:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 09:22:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 09:22:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-02 09:22:25,262 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-02 09:22:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:25,262 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-02 09:22:25,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:22:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-02 09:22:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:22:25,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:25,263 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:22:25,263 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]=== [2018-02-02 09:22:25,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-02-02 09:22:25,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:25,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:25,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:25,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:25,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:25,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:25,442 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-02 09:22:25,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:22:25,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:22:25,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:22:25,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:22:25,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:22:25,443 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-02-02 09:22:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:25,616 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 09:22:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:22:25,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 09:22:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:25,617 INFO L225 Difference]: With dead ends: 75 [2018-02-02 09:22:25,617 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 09:22:25,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:22:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 09:22:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-02-02 09:22:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 09:22:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 09:22:25,621 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-02-02 09:22:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:25,621 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 09:22:25,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:22:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 09:22:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:22:25,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:25,622 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] [2018-02-02 09:22:25,622 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]=== [2018-02-02 09:22:25,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-02-02 09:22:25,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:25,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:25,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:25,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:25,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:25,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:25,825 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-02 09:22:25,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:22:25,826 INFO L209 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-02 09:22:25,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:25,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:22:25,907 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-02 09:22:25,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:25,918 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-02 09:22:25,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:25,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:22:25,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 09:22:26,165 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-02 09:22:26,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:22:26,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-02 09:22:26,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:22:26,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:22:26,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:22:26,189 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 18 states. [2018-02-02 09:22:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:26,414 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 09:22:26,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:22:26,415 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-02-02 09:22:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:26,415 INFO L225 Difference]: With dead ends: 79 [2018-02-02 09:22:26,416 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 09:22:26,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:22:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 09:22:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-02-02 09:22:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 09:22:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-02 09:22:26,420 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 23 [2018-02-02 09:22:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:26,420 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-02 09:22:26,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:22:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-02 09:22:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:22:26,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:26,420 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:22:26,421 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]=== [2018-02-02 09:22:26,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-02-02 09:22:26,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:26,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:26,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:26,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:26,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:26,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:22:26,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:22:26,587 INFO L209 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-02 09:22:26,591 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:22:26,604 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:22:26,606 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:22:26,607 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:22:26,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:22:26,628 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-02 09:22:26,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:26,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 20 treesize of output 19 [2018-02-02 09:22:26,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:26,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:22:26,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 09:22:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:22:26,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:22:26,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-02-02 09:22:26,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:22:26,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:22:26,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:22:26,808 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 22 states. [2018-02-02 09:22:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:27,125 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-02-02 09:22:27,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:22:27,126 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-02-02 09:22:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:27,126 INFO L225 Difference]: With dead ends: 84 [2018-02-02 09:22:27,126 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 09:22:27,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:22:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 09:22:27,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-02 09:22:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 09:22:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-02 09:22:27,129 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 27 [2018-02-02 09:22:27,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:27,130 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-02 09:22:27,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:22:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-02 09:22:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 09:22:27,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:27,131 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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-02 09:22:27,131 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]=== [2018-02-02 09:22:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1407021697, now seen corresponding path program 1 times [2018-02-02 09:22:27,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:27,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:27,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:27,132 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:22:27,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:27,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-02 09:22:27,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:22:27,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:22:27,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:22:27,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:22:27,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:22:27,177 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 5 states. [2018-02-02 09:22:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:27,185 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-02-02 09:22:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:22:27,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-02-02 09:22:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:27,186 INFO L225 Difference]: With dead ends: 88 [2018-02-02 09:22:27,186 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 09:22:27,186 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-02 09:22:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 09:22:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-02-02 09:22:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 09:22:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-02-02 09:22:27,190 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 46 [2018-02-02 09:22:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:27,190 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-02-02 09:22:27,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:22:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-02-02 09:22:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:22:27,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:27,192 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:22:27,192 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]=== [2018-02-02 09:22:27,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1586719882, now seen corresponding path program 1 times [2018-02-02 09:22:27,192 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:27,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:27,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:27,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:27,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:27,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 09:22:27,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:22:27,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:22:27,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:22:27,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:22:27,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:22:27,269 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 6 states. [2018-02-02 09:22:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:27,371 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2018-02-02 09:22:27,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:22:27,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-02 09:22:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:27,372 INFO L225 Difference]: With dead ends: 128 [2018-02-02 09:22:27,372 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 09:22:27,373 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-02 09:22:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 09:22:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-02-02 09:22:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 09:22:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-02-02 09:22:27,377 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 47 [2018-02-02 09:22:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:27,377 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-02-02 09:22:27,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:22:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-02-02 09:22:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:22:27,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:27,379 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:22:27,379 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]=== [2018-02-02 09:22:27,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1586719883, now seen corresponding path program 1 times [2018-02-02 09:22:27,379 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:27,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:27,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:27,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:27,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:27,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:22:27,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:22:27,441 INFO L209 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-02 09:22:27,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:27,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:22:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:22:27,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:22:27,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-02 09:22:27,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:22:27,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:22:27,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:22:27,556 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 13 states. [2018-02-02 09:22:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:27,610 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2018-02-02 09:22:27,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:22:27,612 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-02-02 09:22:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:27,613 INFO L225 Difference]: With dead ends: 116 [2018-02-02 09:22:27,613 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 09:22:27,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:22:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 09:22:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-02 09:22:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 09:22:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-02-02 09:22:27,618 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 47 [2018-02-02 09:22:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:27,618 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-02-02 09:22:27,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:22:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-02-02 09:22:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 09:22:27,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:27,620 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:22:27,620 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]=== [2018-02-02 09:22:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash -76853918, now seen corresponding path program 2 times [2018-02-02 09:22:27,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:27,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:27,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:27,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:27,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:27,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:22:27,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:22:27,721 INFO L209 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-02 09:22:27,728 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:22:27,746 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:22:27,748 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:22:27,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:22:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 09:22:27,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:22:27,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-02-02 09:22:27,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:22:27,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:22:27,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:22:27,809 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 11 states. [2018-02-02 09:22:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:27,932 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2018-02-02 09:22:27,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:22:27,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-02-02 09:22:27,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:27,933 INFO L225 Difference]: With dead ends: 145 [2018-02-02 09:22:27,933 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 09:22:27,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:22:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 09:22:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 117. [2018-02-02 09:22:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 09:22:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2018-02-02 09:22:27,936 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 51 [2018-02-02 09:22:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:27,936 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2018-02-02 09:22:27,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:22:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-02-02 09:22:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 09:22:27,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:27,937 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 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] [2018-02-02 09:22:27,937 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]=== [2018-02-02 09:22:27,937 INFO L82 PathProgramCache]: Analyzing trace with hash 245448947, now seen corresponding path program 1 times [2018-02-02 09:22:27,937 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:27,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:27,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:27,938 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:22:27,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:27,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:22:28,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:22:28,080 INFO L209 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-02 09:22:28,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:28,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:22:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:22:28,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:22:28,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-02 09:22:28,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:22:28,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:22:28,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:22:28,202 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 17 states. [2018-02-02 09:22:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:28,258 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-02-02 09:22:28,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:22:28,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 09:22:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:28,262 INFO L225 Difference]: With dead ends: 123 [2018-02-02 09:22:28,262 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 09:22:28,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:22:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 09:22:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-02-02 09:22:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 09:22:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-02-02 09:22:28,266 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 56 [2018-02-02 09:22:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:28,266 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-02-02 09:22:28,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:22:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-02-02 09:22:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:22:28,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:28,268 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 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] [2018-02-02 09:22:28,268 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]=== [2018-02-02 09:22:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1616077308, now seen corresponding path program 2 times [2018-02-02 09:22:28,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:28,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:28,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:28,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:22:28,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:28,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:22:28,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:22:28,352 INFO L209 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-02 09:22:28,358 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:22:28,365 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:22:28,375 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:22:28,377 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:22:28,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:22:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:22:28,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:22:28,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-02 09:22:28,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:22:28,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:22:28,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:22:28,459 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 19 states. [2018-02-02 09:22:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:22:28,546 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-02-02 09:22:28,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:22:28,548 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 09:22:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:22:28,549 INFO L225 Difference]: With dead ends: 127 [2018-02-02 09:22:28,549 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 09:22:28,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:22:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 09:22:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-02-02 09:22:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 09:22:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-02-02 09:22:28,553 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 60 [2018-02-02 09:22:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:22:28,553 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-02-02 09:22:28,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:22:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-02-02 09:22:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 09:22:28,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:22:28,554 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 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] [2018-02-02 09:22:28,554 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]=== [2018-02-02 09:22:28,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1519113861, now seen corresponding path program 3 times [2018-02-02 09:22:28,558 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:22:28,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:22:28,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:28,559 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:22:28,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:22:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:22:28,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:22:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:22:28,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:22:28,673 INFO L209 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-02 09:22:28,677 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 09:22:28,686 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:22:28,690 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:22:28,692 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:22:28,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:22:28,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-02 09:22:28,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:28,726 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-02 09:22:28,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:28,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-02 09:22:28,728 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:28,740 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-02 09:22:28,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:28,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:22:28,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 09:22:28,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:22:28,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:22:28,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-02-02 09:22:28,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:28,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:22:28,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:22:28,902 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 37 treesize of output 31 [2018-02-02 09:22:28,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:28,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:22:28,918 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 31 treesize of output 40 [2018-02-02 09:22:28,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:28,934 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 29 treesize of output 28 [2018-02-02 09:22:28,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:22:28,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 09:22:28,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-02 09:22:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 09:22:29,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:22:29,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-02-02 09:22:29,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:22:29,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:22:29,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=424, Unknown=1, NotChecked=0, Total=506 [2018-02-02 09:22:29,023 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 23 states. [2018-02-02 09:22:51,492 WARN L143 SmtUtils]: Spent 14336ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-02 09:23:11,733 WARN L146 SmtUtils]: Spent 20189ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-02 09:23:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:12,032 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2018-02-02 09:23:12,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:23:12,032 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-02-02 09:23:12,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:12,033 INFO L225 Difference]: With dead ends: 200 [2018-02-02 09:23:12,033 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 09:23:12,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=294, Invalid=1509, Unknown=3, NotChecked=0, Total=1806 [2018-02-02 09:23:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 09:23:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 144. [2018-02-02 09:23:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 09:23:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-02-02 09:23:12,038 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 64 [2018-02-02 09:23:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:12,039 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-02-02 09:23:12,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:23:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-02-02 09:23:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 09:23:12,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:12,040 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 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] [2018-02-02 09:23:12,040 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]=== [2018-02-02 09:23:12,040 INFO L82 PathProgramCache]: Analyzing trace with hash -487268723, now seen corresponding path program 1 times [2018-02-02 09:23:12,040 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:12,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:12,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,041 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:23:12,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:12,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:23:12,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:12,161 INFO L209 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-02 09:23:12,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:12,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:23:12,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:12,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-02-02 09:23:12,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:23:12,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:23:12,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:23:12,325 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 23 states. [2018-02-02 09:23:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:12,390 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-02-02 09:23:12,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:23:12,390 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-02-02 09:23:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:12,391 INFO L225 Difference]: With dead ends: 150 [2018-02-02 09:23:12,391 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 09:23:12,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:23:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 09:23:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-02 09:23:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 09:23:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-02-02 09:23:12,395 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 68 [2018-02-02 09:23:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:12,395 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-02-02 09:23:12,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:23:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-02-02 09:23:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 09:23:12,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:12,396 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-02 09:23:12,396 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]=== [2018-02-02 09:23:12,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2145863146, now seen corresponding path program 2 times [2018-02-02 09:23:12,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:12,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:12,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:12,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:12,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 09:23:12,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:12,535 INFO L209 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-02 09:23:12,551 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:23:12,564 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:23:12,577 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:23:12,580 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:23:12,583 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:12,598 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-02 09:23:12,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:12,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:23:12,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:23:12,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:23:12,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:23:12,620 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-02 09:23:12,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:12,624 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-02 09:23:12,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-02 09:23:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 09:23:12,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:12,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-02-02 09:23:12,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:23:12,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:23:12,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:23:12,659 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 13 states. [2018-02-02 09:23:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:12,980 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2018-02-02 09:23:12,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:23:12,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-02-02 09:23:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:12,982 INFO L225 Difference]: With dead ends: 193 [2018-02-02 09:23:12,982 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 09:23:12,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:23:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 09:23:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-02-02 09:23:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 09:23:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-02 09:23:12,986 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 72 [2018-02-02 09:23:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:12,986 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-02 09:23:12,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:23:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-02 09:23:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 09:23:12,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:12,987 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-02 09:23:12,987 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]=== [2018-02-02 09:23:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1300106032, now seen corresponding path program 1 times [2018-02-02 09:23:12,987 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:12,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:12,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:12,989 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:23:12,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:13,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 09:23:13,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:23:13,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:23:13,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:23:13,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:23:13,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:23:13,029 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 4 states. [2018-02-02 09:23:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:23:13,053 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-02-02 09:23:13,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:23:13,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 09:23:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:23:13,054 INFO L225 Difference]: With dead ends: 143 [2018-02-02 09:23:13,054 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 09:23:13,054 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-02 09:23:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 09:23:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-02-02 09:23:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 09:23:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-02 09:23:13,056 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 73 [2018-02-02 09:23:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:23:13,057 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-02 09:23:13,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:23:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-02 09:23:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 09:23:13,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:23:13,057 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-02 09:23:13,057 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]=== [2018-02-02 09:23:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1928926345, now seen corresponding path program 1 times [2018-02-02 09:23:13,057 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:23:13,058 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:23:13,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:13,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:13,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:23:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:13,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:23:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 09:23:13,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:23:13,222 INFO L209 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-02 09:23:13,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:23:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:23:13,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:23:13,267 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-02 09:23:13,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:13,279 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-02 09:23:13,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:23:13,290 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-02 09:23:13,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-02-02 09:23:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 138 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:23:16,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:23:16,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2018-02-02 09:23:16,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 09:23:16,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 09:23:16,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=817, Unknown=1, NotChecked=0, Total=930 [2018-02-02 09:23:16,309 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 31 states. Received shutdown request... [2018-02-02 09:23:43,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:23:43,516 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:23:43,519 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:23:43,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:23:43 BoogieIcfgContainer [2018-02-02 09:23:43,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:23:43,520 INFO L168 Benchmark]: Toolchain (without parser) took 79541.09 ms. Allocated memory was 401.6 MB in the beginning and 715.1 MB in the end (delta: 313.5 MB). Free memory was 358.4 MB in the beginning and 639.6 MB in the end (delta: -281.2 MB). Peak memory consumption was 32.4 MB. Max. memory is 5.3 GB. [2018-02-02 09:23:43,521 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:23:43,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.27 ms. Allocated memory is still 401.6 MB. Free memory was 358.4 MB in the beginning and 345.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:23:43,521 INFO L168 Benchmark]: Boogie Preprocessor took 30.65 ms. Allocated memory is still 401.6 MB. Free memory was 345.2 MB in the beginning and 343.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:23:43,522 INFO L168 Benchmark]: RCFGBuilder took 267.41 ms. Allocated memory is still 401.6 MB. Free memory was 343.9 MB in the beginning and 320.4 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:23:43,522 INFO L168 Benchmark]: TraceAbstraction took 79068.04 ms. Allocated memory was 401.6 MB in the beginning and 715.1 MB in the end (delta: 313.5 MB). Free memory was 319.0 MB in the beginning and 639.6 MB in the end (delta: -320.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:23:43,523 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 172.27 ms. Allocated memory is still 401.6 MB. Free memory was 358.4 MB in the beginning and 345.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.65 ms. Allocated memory is still 401.6 MB. Free memory was 345.2 MB in the beginning and 343.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 267.41 ms. Allocated memory is still 401.6 MB. Free memory was 343.9 MB in the beginning and 320.4 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 79068.04 ms. Allocated memory was 401.6 MB in the beginning and 715.1 MB in the end (delta: 313.5 MB). Free memory was 319.0 MB in the beginning and 639.6 MB in the end (delta: -320.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 23 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 15 error locations. TIMEOUT Result, 79.0s OverallTime, 18 OverallIterations, 11 TraceHistogramMax, 72.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1183 SDtfs, 983 SDslu, 7118 SDs, 0 SdLazy, 3404 SolverSat, 225 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 34.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 780 GetRequests, 495 SyntacticMatches, 5 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 41.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=15, 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.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 212 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1327 ConstructedInterpolants, 75 QuantifiedInterpolants, 505268 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1720 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 1245/2250 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_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-23-43-530.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-23-43-530.csv Completed graceful shutdown