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_true-valid-memsafety_true-termination.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 09:28:14,463 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-02-02 09:28:14,464 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 09:28:14,477 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 09:28:14,477 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 09:28:14,478 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 09:28:14,479 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 09:28:14,480 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 09:28:14,482 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 09:28:14,482 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 09:28:14,483 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 09:28:14,484 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 09:28:14,485 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 09:28:14,486 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 09:28:14,486 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 09:28:14,488 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 09:28:14,490 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 09:28:14,491 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 09:28:14,492 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 09:28:14,493 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 09:28:14,495 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 09:28:14,495 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 09:28:14,496 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 09:28:14,496 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 09:28:14,497 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 09:28:14,498 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 09:28:14,498 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 09:28:14,499 INFO  L177        SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 09:28:14,499 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 09:28:14,499 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 09:28:14,499 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 09:28:14,500 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:28:14,509 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-02-02 09:28:14,509 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 09:28:14,510 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 09:28:14,510 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-02-02 09:28:14,510 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-02-02 09:28:14,510 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 09:28:14,510 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-02-02 09:28:14,511 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 09:28:14,511 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-02-02 09:28:14,511 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-02-02 09:28:14,511 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-02-02 09:28:14,511 INFO  L133        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 09:28:14,511 INFO  L133        SettingsManager]:  * Bitprecise bitfields=true
[2018-02-02 09:28:14,511 INFO  L133        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2018-02-02 09:28:14,511 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 09:28:14,511 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-02-02 09:28:14,512 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 09:28:14,512 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-02-02 09:28:14,512 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-02-02 09:28:14,512 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-02-02 09:28:14,512 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 09:28:14,512 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 09:28:14,512 INFO  L133        SettingsManager]:  * Interpolant automaton=TWOTRACK
[2018-02-02 09:28:14,512 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-02-02 09:28:14,512 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-02-02 09:28:14,541 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 09:28:14,549 INFO  L266   ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 09:28:14,551 INFO  L222   ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 09:28:14,552 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-02-02 09:28:14,553 INFO  L276        PluginConnector]: CDTParser initialized
[2018-02-02 09:28:14,553 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_true-valid-memsafety_true-termination.i
[2018-02-02 09:28:14,701 INFO  L304   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 09:28:14,702 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 09:28:14,702 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 09:28:14,702 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 09:28:14,706 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 09:28:14,707 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:28:14" (1/1) ...
[2018-02-02 09:28:14,709 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270c7f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14, skipping insertion in model container
[2018-02-02 09:28:14,709 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:28:14" (1/1) ...
[2018-02-02 09:28:14,719 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-02-02 09:28:14,754 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-02-02 09:28:14,855 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-02-02 09:28:14,872 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-02-02 09:28:14,879 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14 WrapperNode
[2018-02-02 09:28:14,879 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 09:28:14,880 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 09:28:14,880 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 09:28:14,880 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 09:28:14,891 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14" (1/1) ...
[2018-02-02 09:28:14,891 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14" (1/1) ...
[2018-02-02 09:28:14,898 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14" (1/1) ...
[2018-02-02 09:28:14,899 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14" (1/1) ...
[2018-02-02 09:28:14,903 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14" (1/1) ...
[2018-02-02 09:28:14,906 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14" (1/1) ...
[2018-02-02 09:28:14,907 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14" (1/1) ...
[2018-02-02 09:28:14,909 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 09:28:14,910 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 09:28:14,910 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 09:28:14,910 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-02-02 09:28:14,911 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14" (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:28:14,951 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 09:28:14,952 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 09:28:14,952 INFO  L136     BoogieDeclarations]: Found implementation of procedure ldv_malloc
[2018-02-02 09:28:14,952 INFO  L136     BoogieDeclarations]: Found implementation of procedure alloc_17
[2018-02-02 09:28:14,952 INFO  L136     BoogieDeclarations]: Found implementation of procedure free_17
[2018-02-02 09:28:14,952 INFO  L136     BoogieDeclarations]: Found implementation of procedure entry_point
[2018-02-02 09:28:14,952 INFO  L136     BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 09:28:14,952 INFO  L128     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-02 09:28:14,953 INFO  L128     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-02 09:28:14,953 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 09:28:14,953 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 09:28:14,953 INFO  L128     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 09:28:14,953 INFO  L128     BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 09:28:14,953 INFO  L128     BoogieDeclarations]: Found specification of procedure free
[2018-02-02 09:28:14,953 INFO  L128     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 09:28:14,953 INFO  L128     BoogieDeclarations]: Found specification of procedure ldv_malloc
[2018-02-02 09:28:14,953 INFO  L128     BoogieDeclarations]: Found specification of procedure alloc_17
[2018-02-02 09:28:14,954 INFO  L128     BoogieDeclarations]: Found specification of procedure free_17
[2018-02-02 09:28:14,954 INFO  L128     BoogieDeclarations]: Found specification of procedure entry_point
[2018-02-02 09:28:14,954 INFO  L128     BoogieDeclarations]: Found specification of procedure main
[2018-02-02 09:28:14,954 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 09:28:14,954 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 09:28:15,144 INFO  L257             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 09:28:15,144 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:28:15 BoogieIcfgContainer
[2018-02-02 09:28:15,144 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 09:28:15,145 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 09:28:15,145 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 09:28:15,147 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-02-02 09:28:15,147 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:28:14" (1/3) ...
[2018-02-02 09:28:15,147 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde4699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:28:15, skipping insertion in model container
[2018-02-02 09:28:15,147 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:28:14" (2/3) ...
[2018-02-02 09:28:15,148 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde4699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:28:15, skipping insertion in model container
[2018-02-02 09:28:15,148 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:28:15" (3/3) ...
[2018-02-02 09:28:15,149 INFO  L107   eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i
[2018-02-02 09:28:15,153 INFO  L128   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-02 09:28:15,160 INFO  L140   ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations.
[2018-02-02 09:28:15,192 INFO  L322      AbstractCegarLoop]: Interprodecural is true
[2018-02-02 09:28:15,192 INFO  L323      AbstractCegarLoop]: Hoare is false
[2018-02-02 09:28:15,192 INFO  L324      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-02 09:28:15,193 INFO  L325      AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-02 09:28:15,193 INFO  L326      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 09:28:15,193 INFO  L327      AbstractCegarLoop]: Difference is false
[2018-02-02 09:28:15,193 INFO  L328      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 09:28:15,193 INFO  L333      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 09:28:15,194 INFO  L87    2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 09:28:15,205 INFO  L276                IsEmpty]: Start isEmpty. Operand 76 states.
[2018-02-02 09:28:15,214 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-02 09:28:15,214 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:15,215 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:28:15,215 INFO  L371      AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:15,219 INFO  L82        PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times
[2018-02-02 09:28:15,221 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:15,221 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:15,270 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:15,270 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:15,270 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:15,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:15,316 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:15,435 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:28:15,436 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:28:15,437 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:28:15,438 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:28:15,495 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:28:15,496 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:28:15,498 INFO  L87              Difference]: Start difference. First operand 76 states. Second operand 5 states.
[2018-02-02 09:28:15,548 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:15,548 INFO  L93              Difference]: Finished difference Result 82 states and 90 transitions.
[2018-02-02 09:28:15,548 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-02-02 09:28:15,550 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2018-02-02 09:28:15,550 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:15,558 INFO  L225             Difference]: With dead ends: 82
[2018-02-02 09:28:15,558 INFO  L226             Difference]: Without dead ends: 79
[2018-02-02 09:28:15,560 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:28:15,573 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2018-02-02 09:28:15,590 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77.
[2018-02-02 09:28:15,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 77 states.
[2018-02-02 09:28:15,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions.
[2018-02-02 09:28:15,593 INFO  L78                 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17
[2018-02-02 09:28:15,593 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:15,593 INFO  L432      AbstractCegarLoop]: Abstraction has 77 states and 85 transitions.
[2018-02-02 09:28:15,593 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:28:15,593 INFO  L276                IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions.
[2018-02-02 09:28:15,594 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-02 09:28:15,594 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:15,595 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:28:15,595 INFO  L371      AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:15,595 INFO  L82        PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times
[2018-02-02 09:28:15,595 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:15,595 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:15,597 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:15,597 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:15,597 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:15,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:15,609 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:15,634 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:28:15,634 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:28:15,634 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 09:28:15,635 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 09:28:15,636 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 09:28:15,636 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:28:15,636 INFO  L87              Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states.
[2018-02-02 09:28:15,721 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:15,721 INFO  L93              Difference]: Finished difference Result 112 states and 125 transitions.
[2018-02-02 09:28:15,722 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-02-02 09:28:15,722 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-02-02 09:28:15,722 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:15,723 INFO  L225             Difference]: With dead ends: 112
[2018-02-02 09:28:15,723 INFO  L226             Difference]: Without dead ends: 107
[2018-02-02 09:28:15,724 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:28:15,724 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2018-02-02 09:28:15,729 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75.
[2018-02-02 09:28:15,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2018-02-02 09:28:15,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions.
[2018-02-02 09:28:15,731 INFO  L78                 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17
[2018-02-02 09:28:15,732 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:15,732 INFO  L432      AbstractCegarLoop]: Abstraction has 75 states and 82 transitions.
[2018-02-02 09:28:15,732 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 09:28:15,732 INFO  L276                IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions.
[2018-02-02 09:28:15,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-02 09:28:15,732 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:15,732 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:28:15,733 INFO  L371      AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:15,733 INFO  L82        PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times
[2018-02-02 09:28:15,733 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:15,733 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:15,734 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:15,734 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:15,735 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:15,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:15,748 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:15,792 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:28:15,792 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:28:15,793 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:28:15,793 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:28:15,793 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:28:15,793 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:28:15,793 INFO  L87              Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states.
[2018-02-02 09:28:15,896 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:15,896 INFO  L93              Difference]: Finished difference Result 76 states and 83 transitions.
[2018-02-02 09:28:15,896 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-02-02 09:28:15,897 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2018-02-02 09:28:15,897 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:15,898 INFO  L225             Difference]: With dead ends: 76
[2018-02-02 09:28:15,898 INFO  L226             Difference]: Without dead ends: 76
[2018-02-02 09:28:15,898 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:28:15,898 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2018-02-02 09:28:15,902 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74.
[2018-02-02 09:28:15,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 74 states.
[2018-02-02 09:28:15,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions.
[2018-02-02 09:28:15,903 INFO  L78                 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19
[2018-02-02 09:28:15,903 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:15,903 INFO  L432      AbstractCegarLoop]: Abstraction has 74 states and 81 transitions.
[2018-02-02 09:28:15,904 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:28:15,904 INFO  L276                IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions.
[2018-02-02 09:28:15,904 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-02 09:28:15,904 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:15,904 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:28:15,904 INFO  L371      AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:15,905 INFO  L82        PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times
[2018-02-02 09:28:15,905 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:15,905 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:15,906 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:15,906 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:15,906 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:15,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:15,921 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:16,096 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:28:16,097 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:28:16,097 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-02 09:28:16,097 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 09:28:16,098 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 09:28:16,098 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:28:16,098 INFO  L87              Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states.
[2018-02-02 09:28:16,320 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:16,320 INFO  L93              Difference]: Finished difference Result 80 states and 87 transitions.
[2018-02-02 09:28:16,321 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2018-02-02 09:28:16,321 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 19
[2018-02-02 09:28:16,321 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:16,322 INFO  L225             Difference]: With dead ends: 80
[2018-02-02 09:28:16,322 INFO  L226             Difference]: Without dead ends: 80
[2018-02-02 09:28:16,323 INFO  L554         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2018-02-02 09:28:16,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2018-02-02 09:28:16,326 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77.
[2018-02-02 09:28:16,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 77 states.
[2018-02-02 09:28:16,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions.
[2018-02-02 09:28:16,328 INFO  L78                 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19
[2018-02-02 09:28:16,328 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:16,328 INFO  L432      AbstractCegarLoop]: Abstraction has 77 states and 84 transitions.
[2018-02-02 09:28:16,329 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 09:28:16,329 INFO  L276                IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions.
[2018-02-02 09:28:16,329 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-02 09:28:16,329 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:16,329 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:28:16,329 INFO  L371      AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:16,330 INFO  L82        PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times
[2018-02-02 09:28:16,330 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:16,330 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:16,331 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:16,331 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:16,331 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:16,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:16,340 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:16,371 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:28:16,372 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:28:16,372 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 09:28:16,372 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:28:16,372 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:28:16,373 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:28:16,373 INFO  L87              Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states.
[2018-02-02 09:28:16,399 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:16,399 INFO  L93              Difference]: Finished difference Result 77 states and 83 transitions.
[2018-02-02 09:28:16,399 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-02-02 09:28:16,399 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2018-02-02 09:28:16,400 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:16,400 INFO  L225             Difference]: With dead ends: 77
[2018-02-02 09:28:16,400 INFO  L226             Difference]: Without dead ends: 77
[2018-02-02 09:28:16,400 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:28:16,400 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2018-02-02 09:28:16,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77.
[2018-02-02 09:28:16,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 77 states.
[2018-02-02 09:28:16,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions.
[2018-02-02 09:28:16,404 INFO  L78                 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19
[2018-02-02 09:28:16,404 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:16,404 INFO  L432      AbstractCegarLoop]: Abstraction has 77 states and 83 transitions.
[2018-02-02 09:28:16,405 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:28:16,405 INFO  L276                IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions.
[2018-02-02 09:28:16,405 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-02 09:28:16,405 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:16,405 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:28:16,405 INFO  L371      AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:16,405 INFO  L82        PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times
[2018-02-02 09:28:16,405 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:16,405 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:16,406 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:16,406 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:16,407 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:16,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:16,423 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:16,599 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:28:16,599 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:28:16,600 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:28:16,607 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:16,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:16,637 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:28:16,679 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:28:16,680 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:16,690 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:28:16,691 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:16,699 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars,  End of recursive call:  and 2 xjuncts.
[2018-02-02 09:28:16,700 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36
[2018-02-02 09:28:16,946 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:28:16,962 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:28:16,962 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17
[2018-02-02 09:28:16,963 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 09:28:16,963 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 09:28:16,963 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306
[2018-02-02 09:28:16,963 INFO  L87              Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 18 states.
[2018-02-02 09:28:17,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:17,170 INFO  L93              Difference]: Finished difference Result 82 states and 88 transitions.
[2018-02-02 09:28:17,170 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2018-02-02 09:28:17,170 INFO  L78                 Accepts]: Start accepts. Automaton has 18 states. Word has length 23
[2018-02-02 09:28:17,170 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:17,171 INFO  L225             Difference]: With dead ends: 82
[2018-02-02 09:28:17,171 INFO  L226             Difference]: Without dead ends: 82
[2018-02-02 09:28:17,171 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:28:17,171 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2018-02-02 09:28:17,175 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81.
[2018-02-02 09:28:17,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-02-02 09:28:17,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions.
[2018-02-02 09:28:17,176 INFO  L78                 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23
[2018-02-02 09:28:17,176 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:17,176 INFO  L432      AbstractCegarLoop]: Abstraction has 81 states and 87 transitions.
[2018-02-02 09:28:17,176 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 09:28:17,176 INFO  L276                IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions.
[2018-02-02 09:28:17,177 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-02-02 09:28:17,177 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:17,177 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:28:17,177 INFO  L371      AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:17,177 INFO  L82        PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times
[2018-02-02 09:28:17,177 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:17,177 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:17,178 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:17,178 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:17,178 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:17,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:17,189 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:17,341 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:28:17,341 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:28:17,342 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:28:17,346 INFO  L101   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:28:17,361 INFO  L201   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:28:17,364 INFO  L214   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:28:17,365 INFO  L239   tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:28:17,367 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:28:17,394 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:28:17,394 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:17,407 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19
[2018-02-02 09:28:17,407 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:17,427 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars,  End of recursive call:  and 2 xjuncts.
[2018-02-02 09:28:17,428 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36
[2018-02-02 09:28:17,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:28:17,601 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:28:17,602 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22
[2018-02-02 09:28:17,602 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-02 09:28:17,602 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-02 09:28:17,602 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506
[2018-02-02 09:28:17,603 INFO  L87              Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 23 states.
[2018-02-02 09:28:17,886 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:17,886 INFO  L93              Difference]: Finished difference Result 81 states and 87 transitions.
[2018-02-02 09:28:17,887 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2018-02-02 09:28:17,887 INFO  L78                 Accepts]: Start accepts. Automaton has 23 states. Word has length 27
[2018-02-02 09:28:17,887 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:17,887 INFO  L225             Difference]: With dead ends: 81
[2018-02-02 09:28:17,887 INFO  L226             Difference]: Without dead ends: 81
[2018-02-02 09:28:17,888 INFO  L554         BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702
[2018-02-02 09:28:17,888 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2018-02-02 09:28:17,891 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79.
[2018-02-02 09:28:17,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 79 states.
[2018-02-02 09:28:17,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions.
[2018-02-02 09:28:17,892 INFO  L78                 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 27
[2018-02-02 09:28:17,892 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:17,892 INFO  L432      AbstractCegarLoop]: Abstraction has 79 states and 85 transitions.
[2018-02-02 09:28:17,892 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-02 09:28:17,893 INFO  L276                IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions.
[2018-02-02 09:28:17,893 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-02-02 09:28:17,893 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:17,895 INFO  L351         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:28:17,895 INFO  L371      AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:17,895 INFO  L82        PathProgramCache]: Analyzing trace with hash 1811355495, now seen corresponding path program 1 times
[2018-02-02 09:28:17,895 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:17,895 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:17,896 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:17,896 INFO  L99    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:28:17,896 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:17,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:17,904 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:17,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2018-02-02 09:28:17,932 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:28:17,932 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:28:17,932 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:28:17,932 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:28:17,932 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:28:17,932 INFO  L87              Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states.
[2018-02-02 09:28:17,941 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:17,942 INFO  L93              Difference]: Finished difference Result 83 states and 89 transitions.
[2018-02-02 09:28:17,942 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-02-02 09:28:17,942 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 38
[2018-02-02 09:28:17,942 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:17,942 INFO  L225             Difference]: With dead ends: 83
[2018-02-02 09:28:17,942 INFO  L226             Difference]: Without dead ends: 83
[2018-02-02 09:28:17,943 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:28:17,943 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2018-02-02 09:28:17,945 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81.
[2018-02-02 09:28:17,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-02-02 09:28:17,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions.
[2018-02-02 09:28:17,946 INFO  L78                 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 38
[2018-02-02 09:28:17,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:17,946 INFO  L432      AbstractCegarLoop]: Abstraction has 81 states and 87 transitions.
[2018-02-02 09:28:17,946 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:28:17,947 INFO  L276                IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions.
[2018-02-02 09:28:17,947 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-02-02 09:28:17,947 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:17,948 INFO  L351         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:28:17,948 INFO  L371      AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:17,948 INFO  L82        PathProgramCache]: Analyzing trace with hash -1161542589, now seen corresponding path program 1 times
[2018-02-02 09:28:17,948 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:17,948 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:17,949 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:17,949 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:17,949 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:17,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:17,958 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:17,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 09:28:17,990 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:28:17,990 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:28:17,990 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:28:17,990 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:28:17,990 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:28:17,991 INFO  L87              Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states.
[2018-02-02 09:28:18,084 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:18,084 INFO  L93              Difference]: Finished difference Result 123 states and 136 transitions.
[2018-02-02 09:28:18,085 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2018-02-02 09:28:18,085 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 39
[2018-02-02 09:28:18,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:18,085 INFO  L225             Difference]: With dead ends: 123
[2018-02-02 09:28:18,086 INFO  L226             Difference]: Without dead ends: 123
[2018-02-02 09:28:18,086 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:28:18,086 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2018-02-02 09:28:18,088 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106.
[2018-02-02 09:28:18,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 106 states.
[2018-02-02 09:28:18,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions.
[2018-02-02 09:28:18,089 INFO  L78                 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 39
[2018-02-02 09:28:18,089 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:18,089 INFO  L432      AbstractCegarLoop]: Abstraction has 106 states and 121 transitions.
[2018-02-02 09:28:18,089 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:28:18,089 INFO  L276                IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions.
[2018-02-02 09:28:18,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-02-02 09:28:18,090 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:18,090 INFO  L351         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:28:18,090 INFO  L371      AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:18,090 INFO  L82        PathProgramCache]: Analyzing trace with hash -1161542588, now seen corresponding path program 1 times
[2018-02-02 09:28:18,090 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:18,090 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:18,091 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:18,091 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:18,091 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:18,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:18,100 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:18,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:28:18,128 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:28:18,128 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:28:18,139 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:18,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:18,156 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:28:18,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:28:18,192 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:28:18,192 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9
[2018-02-02 09:28:18,193 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 09:28:18,193 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 09:28:18,193 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:28:18,193 INFO  L87              Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 9 states.
[2018-02-02 09:28:18,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:18,212 INFO  L93              Difference]: Finished difference Result 112 states and 127 transitions.
[2018-02-02 09:28:18,215 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-02-02 09:28:18,215 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 39
[2018-02-02 09:28:18,215 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:18,215 INFO  L225             Difference]: With dead ends: 112
[2018-02-02 09:28:18,216 INFO  L226             Difference]: Without dead ends: 112
[2018-02-02 09:28:18,216 INFO  L554         BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:28:18,216 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2018-02-02 09:28:18,219 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110.
[2018-02-02 09:28:18,220 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 110 states.
[2018-02-02 09:28:18,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions.
[2018-02-02 09:28:18,220 INFO  L78                 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 39
[2018-02-02 09:28:18,221 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:18,221 INFO  L432      AbstractCegarLoop]: Abstraction has 110 states and 125 transitions.
[2018-02-02 09:28:18,221 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 09:28:18,221 INFO  L276                IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions.
[2018-02-02 09:28:18,222 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-02-02 09:28:18,222 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:18,222 INFO  L351         BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:28:18,222 INFO  L371      AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:18,222 INFO  L82        PathProgramCache]: Analyzing trace with hash 1952254171, now seen corresponding path program 2 times
[2018-02-02 09:28:18,222 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:18,222 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:18,223 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:18,223 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:18,223 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:18,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:18,231 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:18,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:28:18,262 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:28:18,262 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:28:18,267 INFO  L101   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:28:18,278 INFO  L201   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:28:18,280 INFO  L239   tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:28:18,282 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:28:18,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2018-02-02 09:28:18,319 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:28:18,319 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9
[2018-02-02 09:28:18,319 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 09:28:18,319 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 09:28:18,320 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:28:18,320 INFO  L87              Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 9 states.
[2018-02-02 09:28:18,435 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:18,436 INFO  L93              Difference]: Finished difference Result 141 states and 157 transitions.
[2018-02-02 09:28:18,436 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2018-02-02 09:28:18,436 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 43
[2018-02-02 09:28:18,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:18,437 INFO  L225             Difference]: With dead ends: 141
[2018-02-02 09:28:18,437 INFO  L226             Difference]: Without dead ends: 138
[2018-02-02 09:28:18,438 INFO  L554         BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:28:18,438 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2018-02-02 09:28:18,440 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113.
[2018-02-02 09:28:18,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2018-02-02 09:28:18,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions.
[2018-02-02 09:28:18,442 INFO  L78                 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 43
[2018-02-02 09:28:18,442 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:18,442 INFO  L432      AbstractCegarLoop]: Abstraction has 113 states and 127 transitions.
[2018-02-02 09:28:18,442 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 09:28:18,442 INFO  L276                IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions.
[2018-02-02 09:28:18,446 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 09:28:18,446 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:18,446 INFO  L351         BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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:28:18,446 INFO  L371      AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:18,446 INFO  L82        PathProgramCache]: Analyzing trace with hash 491258907, now seen corresponding path program 1 times
[2018-02-02 09:28:18,446 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:18,446 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:18,447 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:18,447 INFO  L99    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:28:18,447 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:18,457 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:18,458 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:18,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 09:28:18,506 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:28:18,506 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:28:18,518 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:18,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:18,541 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:28:18,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:28:18,606 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:28:18,606 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13
[2018-02-02 09:28:18,606 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 09:28:18,606 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 09:28:18,606 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:28:18,607 INFO  L87              Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 13 states.
[2018-02-02 09:28:18,637 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:18,637 INFO  L93              Difference]: Finished difference Result 119 states and 133 transitions.
[2018-02-02 09:28:18,638 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2018-02-02 09:28:18,638 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 48
[2018-02-02 09:28:18,638 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:18,639 INFO  L225             Difference]: With dead ends: 119
[2018-02-02 09:28:18,639 INFO  L226             Difference]: Without dead ends: 119
[2018-02-02 09:28:18,639 INFO  L554         BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 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:28:18,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2018-02-02 09:28:18,642 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117.
[2018-02-02 09:28:18,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 117 states.
[2018-02-02 09:28:18,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions.
[2018-02-02 09:28:18,643 INFO  L78                 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 48
[2018-02-02 09:28:18,643 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:18,643 INFO  L432      AbstractCegarLoop]: Abstraction has 117 states and 131 transitions.
[2018-02-02 09:28:18,643 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 09:28:18,643 INFO  L276                IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions.
[2018-02-02 09:28:18,644 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-02-02 09:28:18,644 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:18,644 INFO  L351         BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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:28:18,645 INFO  L371      AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:18,645 INFO  L82        PathProgramCache]: Analyzing trace with hash 10320228, now seen corresponding path program 2 times
[2018-02-02 09:28:18,645 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:18,645 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:18,646 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:18,646 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:28:18,646 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:18,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:18,657 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:18,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 09:28:18,709 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:28:18,709 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:28:18,716 INFO  L101   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:28:18,727 INFO  L201   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:28:18,743 INFO  L214   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:28:18,745 INFO  L239   tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:28:18,748 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:28:18,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:28:18,860 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:28:18,860 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15
[2018-02-02 09:28:18,860 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 09:28:18,861 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 09:28:18,861 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210
[2018-02-02 09:28:18,861 INFO  L87              Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 15 states.
[2018-02-02 09:28:18,914 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:28:18,914 INFO  L93              Difference]: Finished difference Result 123 states and 137 transitions.
[2018-02-02 09:28:18,914 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2018-02-02 09:28:18,915 INFO  L78                 Accepts]: Start accepts. Automaton has 15 states. Word has length 52
[2018-02-02 09:28:18,915 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:28:18,915 INFO  L225             Difference]: With dead ends: 123
[2018-02-02 09:28:18,915 INFO  L226             Difference]: Without dead ends: 123
[2018-02-02 09:28:18,916 INFO  L554         BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210
[2018-02-02 09:28:18,916 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2018-02-02 09:28:18,918 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121.
[2018-02-02 09:28:18,918 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 121 states.
[2018-02-02 09:28:18,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions.
[2018-02-02 09:28:18,919 INFO  L78                 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 52
[2018-02-02 09:28:18,920 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:28:18,920 INFO  L432      AbstractCegarLoop]: Abstraction has 121 states and 135 transitions.
[2018-02-02 09:28:18,920 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 09:28:18,920 INFO  L276                IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions.
[2018-02-02 09:28:18,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-02 09:28:18,921 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:28:18,921 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:28:18,921 INFO  L371      AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:28:18,921 INFO  L82        PathProgramCache]: Analyzing trace with hash -1506467283, now seen corresponding path program 3 times
[2018-02-02 09:28:18,921 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:28:18,921 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:28:18,922 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:18,923 INFO  L99    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:28:18,923 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:28:18,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:28:18,934 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:28:19,008 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:28:19,008 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:28:19,008 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:28:19,015 INFO  L101   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-02-02 09:28:19,028 INFO  L254   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-02-02 09:28:19,034 INFO  L254   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-02-02 09:28:19,037 INFO  L239   tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:28:19,041 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:28:19,069 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:28:19,070 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:19,086 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:28:19,086 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:19,098 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:28:19,099 INFO  L267         ElimStorePlain]: Start of recursive call 4:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:19,100 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:28:19,100 INFO  L267         ElimStorePlain]: Start of recursive call 5:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:19,110 INFO  L267         ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars,  End of recursive call:  and 2 xjuncts.
[2018-02-02 09:28:19,110 INFO  L202         ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46
[2018-02-02 09:28:19,233 INFO  L700             Elim1Store]: detected not equals via solver
[2018-02-02 09:28:19,233 INFO  L700             Elim1Store]: detected not equals via solver
[2018-02-02 09:28:19,235 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:28:19,236 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:19,259 INFO  L700             Elim1Store]: detected not equals via solver
[2018-02-02 09:28:19,259 INFO  L700             Elim1Store]: detected not equals via solver
[2018-02-02 09:28:19,260 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:28:19,260 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:19,277 INFO  L700             Elim1Store]: detected not equals via solver
[2018-02-02 09:28:19,278 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:28:19,278 INFO  L267         ElimStorePlain]: Start of recursive call 4:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:19,296 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:28:19,296 INFO  L267         ElimStorePlain]: Start of recursive call 5:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:28:19,311 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:28:19,311 INFO  L202         ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55
[2018-02-02 09:28:19,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2018-02-02 09:28:19,384 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:28:19,384 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21
[2018-02-02 09:28:19,384 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-02 09:28:19,384 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-02 09:28:19,385 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420
[2018-02-02 09:28:19,385 INFO  L87              Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 21 states.
[2018-02-02 09:28:43,753 WARN  L143               SmtUtils]: Spent 16140ms on a formula simplification that was a NOOP. DAG size: 52
[2018-02-02 09:29:04,300 WARN  L146               SmtUtils]: Spent 20509ms on a formula simplification. DAG size of input: 56 DAG size of output 56
[2018-02-02 09:29:04,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:04,585 INFO  L93              Difference]: Finished difference Result 197 states and 216 transitions.
[2018-02-02 09:29:04,586 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2018-02-02 09:29:04,586 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states. Word has length 56
[2018-02-02 09:29:04,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:04,586 INFO  L225             Difference]: With dead ends: 197
[2018-02-02 09:29:04,587 INFO  L226             Difference]: Without dead ends: 197
[2018-02-02 09:29:04,587 INFO  L554         BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482
[2018-02-02 09:29:04,587 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 197 states.
[2018-02-02 09:29:04,589 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140.
[2018-02-02 09:29:04,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 140 states.
[2018-02-02 09:29:04,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions.
[2018-02-02 09:29:04,590 INFO  L78                 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 56
[2018-02-02 09:29:04,590 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:04,590 INFO  L432      AbstractCegarLoop]: Abstraction has 140 states and 165 transitions.
[2018-02-02 09:29:04,590 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-02 09:29:04,590 INFO  L276                IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions.
[2018-02-02 09:29:04,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2018-02-02 09:29:04,591 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:29:04,591 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:29:04,591 INFO  L371      AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:04,591 INFO  L82        PathProgramCache]: Analyzing trace with hash -221692299, now seen corresponding path program 1 times
[2018-02-02 09:29:04,591 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:04,591 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:04,592 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:04,592 INFO  L99    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:29:04,592 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:04,598 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:04,599 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:04,669 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:29:04,669 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:29:04,669 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:29:04,686 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:04,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:04,705 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:29:04,772 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:29:04,791 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:29:04,791 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19
[2018-02-02 09:29:04,791 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 09:29:04,792 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 09:29:04,792 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342
[2018-02-02 09:29:04,792 INFO  L87              Difference]: Start difference. First operand 140 states and 165 transitions. Second operand 19 states.
[2018-02-02 09:29:04,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:04,846 INFO  L93              Difference]: Finished difference Result 146 states and 171 transitions.
[2018-02-02 09:29:04,847 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2018-02-02 09:29:04,847 INFO  L78                 Accepts]: Start accepts. Automaton has 19 states. Word has length 60
[2018-02-02 09:29:04,847 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:04,848 INFO  L225             Difference]: With dead ends: 146
[2018-02-02 09:29:04,848 INFO  L226             Difference]: Without dead ends: 146
[2018-02-02 09:29:04,849 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:29:04,849 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2018-02-02 09:29:04,852 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144.
[2018-02-02 09:29:04,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 144 states.
[2018-02-02 09:29:04,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions.
[2018-02-02 09:29:04,853 INFO  L78                 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 60
[2018-02-02 09:29:04,854 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:04,854 INFO  L432      AbstractCegarLoop]: Abstraction has 144 states and 169 transitions.
[2018-02-02 09:29:04,854 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 09:29:04,854 INFO  L276                IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions.
[2018-02-02 09:29:04,854 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-02 09:29:04,855 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:29:04,855 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:29:04,855 INFO  L371      AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:04,855 INFO  L82        PathProgramCache]: Analyzing trace with hash 1676938814, now seen corresponding path program 2 times
[2018-02-02 09:29:04,855 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:04,855 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:04,856 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:04,856 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:04,856 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:04,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:04,867 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:04,950 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:29:04,951 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:29:04,951 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:29:04,958 INFO  L101   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:29:04,970 INFO  L201   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:29:04,982 INFO  L214   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:29:04,984 INFO  L239   tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:29:04,987 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:29:05,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:05,105 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:29:05,105 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21
[2018-02-02 09:29:05,106 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-02 09:29:05,106 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-02 09:29:05,106 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420
[2018-02-02 09:29:05,106 INFO  L87              Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 21 states.
[2018-02-02 09:29:05,158 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:05,158 INFO  L93              Difference]: Finished difference Result 150 states and 175 transitions.
[2018-02-02 09:29:05,158 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2018-02-02 09:29:05,158 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states. Word has length 64
[2018-02-02 09:29:05,158 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:05,159 INFO  L225             Difference]: With dead ends: 150
[2018-02-02 09:29:05,159 INFO  L226             Difference]: Without dead ends: 150
[2018-02-02 09:29:05,159 INFO  L554         BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420
[2018-02-02 09:29:05,159 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2018-02-02 09:29:05,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148.
[2018-02-02 09:29:05,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 148 states.
[2018-02-02 09:29:05,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions.
[2018-02-02 09:29:05,162 INFO  L78                 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 64
[2018-02-02 09:29:05,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:05,162 INFO  L432      AbstractCegarLoop]: Abstraction has 148 states and 173 transitions.
[2018-02-02 09:29:05,162 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-02 09:29:05,162 INFO  L276                IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions.
[2018-02-02 09:29:05,162 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-02-02 09:29:05,162 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:29:05,163 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:29:05,163 INFO  L371      AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:05,163 INFO  L82        PathProgramCache]: Analyzing trace with hash -1607478905, now seen corresponding path program 3 times
[2018-02-02 09:29:05,163 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:05,163 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:05,163 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:05,163 INFO  L99    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:29:05,164 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:05,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:05,170 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:05,252 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:29:05,253 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:29:05,253 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:29:05,259 INFO  L101   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-02-02 09:29:05,272 INFO  L254   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-02-02 09:29:05,280 INFO  L254   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-02-02 09:29:05,282 INFO  L239   tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:29:05,284 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:29:05,287 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:29:05,287 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:29:05,288 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:29:05,289 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-02-02 09:29:05,364 WARN  L1033  $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true
[2018-02-02 09:29:05,370 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2018-02-02 09:29:05,371 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:29:05,373 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:29:05,373 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11
[2018-02-02 09:29:05,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 3 not checked.
[2018-02-02 09:29:05,404 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:29:05,404 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21
[2018-02-02 09:29:05,405 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-02 09:29:05,405 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-02 09:29:05,405 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=298, Unknown=1, NotChecked=36, Total=420
[2018-02-02 09:29:05,405 INFO  L87              Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 21 states.
[2018-02-02 09:29:05,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:05,756 INFO  L93              Difference]: Finished difference Result 175 states and 202 transitions.
[2018-02-02 09:29:05,756 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2018-02-02 09:29:05,756 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states. Word has length 68
[2018-02-02 09:29:05,756 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:05,757 INFO  L225             Difference]: With dead ends: 175
[2018-02-02 09:29:05,757 INFO  L226             Difference]: Without dead ends: 175
[2018-02-02 09:29:05,757 INFO  L554         BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=1138, Unknown=2, NotChecked=72, Total=1482
[2018-02-02 09:29:05,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 175 states.
[2018-02-02 09:29:05,759 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 146.
[2018-02-02 09:29:05,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 146 states.
[2018-02-02 09:29:05,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions.
[2018-02-02 09:29:05,760 INFO  L78                 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 68
[2018-02-02 09:29:05,760 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:05,760 INFO  L432      AbstractCegarLoop]: Abstraction has 146 states and 164 transitions.
[2018-02-02 09:29:05,760 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-02 09:29:05,760 INFO  L276                IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions.
[2018-02-02 09:29:05,761 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-02-02 09:29:05,761 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:29:05,761 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:29:05,761 INFO  L371      AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:05,761 INFO  L82        PathProgramCache]: Analyzing trace with hash -1497729290, now seen corresponding path program 1 times
[2018-02-02 09:29:05,761 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:05,761 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:05,762 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:05,762 INFO  L99    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:29:05,762 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:05,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:05,770 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:05,798 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:29:05,798 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:29:05,799 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:29:05,799 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:29:05,799 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:29:05,799 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:29:05,799 INFO  L87              Difference]: Start difference. First operand 146 states and 164 transitions. Second operand 4 states.
[2018-02-02 09:29:05,820 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:05,820 INFO  L93              Difference]: Finished difference Result 155 states and 172 transitions.
[2018-02-02 09:29:05,820 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-02-02 09:29:05,820 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 73
[2018-02-02 09:29:05,820 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:05,821 INFO  L225             Difference]: With dead ends: 155
[2018-02-02 09:29:05,821 INFO  L226             Difference]: Without dead ends: 155
[2018-02-02 09:29:05,821 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:29:05,821 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 155 states.
[2018-02-02 09:29:05,823 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149.
[2018-02-02 09:29:05,823 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 149 states.
[2018-02-02 09:29:05,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions.
[2018-02-02 09:29:05,824 INFO  L78                 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 73
[2018-02-02 09:29:05,824 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:05,824 INFO  L432      AbstractCegarLoop]: Abstraction has 149 states and 166 transitions.
[2018-02-02 09:29:05,824 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:29:05,824 INFO  L276                IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions.
[2018-02-02 09:29:05,825 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2018-02-02 09:29:05,825 INFO  L343         BasicCegarLoop]: Found error trace
[2018-02-02 09:29:05,825 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:29:05,825 INFO  L371      AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:05,825 INFO  L82        PathProgramCache]: Analyzing trace with hash 950466152, now seen corresponding path program 1 times
[2018-02-02 09:29:05,825 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:05,825 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:05,826 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:05,826 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:05,826 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:05,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:05,839 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:06,008 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:29:06,008 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:29:06,008 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:29:06,015 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:06,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:06,048 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:29:06,051 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:29:06,052 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:29:06,062 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:29:06,063 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-02-02 09:29:06,073 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:29:06,073 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30
[2018-02-02 09:29:11,275 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:29:11,292 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:29:11,292 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30
[2018-02-02 09:29:11,292 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 31 states
[2018-02-02 09:29:11,292 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2018-02-02 09:29:11,292 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=816, Unknown=2, NotChecked=0, Total=930
[2018-02-02 09:29:11,292 INFO  L87              Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 31 states.
Received shutdown request...
[2018-02-02 09:29:31,175 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2018-02-02 09:29:31,175 WARN  L491      AbstractCegarLoop]: Verification canceled
[2018-02-02 09:29:31,179 WARN  L185   ceAbstractionStarter]: Timeout
[2018-02-02 09:29:31,179 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:29:31 BoogieIcfgContainer
[2018-02-02 09:29:31,179 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 09:29:31,180 INFO  L168              Benchmark]: Toolchain (without parser) took 76478.60 ms. Allocated memory was 398.5 MB in the beginning and 760.7 MB in the end (delta: 362.3 MB). Free memory was 352.4 MB in the beginning and 549.5 MB in the end (delta: -197.1 MB). Peak memory consumption was 165.2 MB. Max. memory is 5.3 GB.
[2018-02-02 09:29:31,181 INFO  L168              Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 398.5 MB. Free memory is still 359.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 09:29:31,181 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 177.40 ms. Allocated memory is still 398.5 MB. Free memory was 352.4 MB in the beginning and 339.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:29:31,181 INFO  L168              Benchmark]: Boogie Preprocessor took 29.29 ms. Allocated memory is still 398.5 MB. Free memory was 339.2 MB in the beginning and 337.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:29:31,181 INFO  L168              Benchmark]: RCFGBuilder took 234.97 ms. Allocated memory is still 398.5 MB. Free memory was 337.9 MB in the beginning and 312.5 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB.
[2018-02-02 09:29:31,181 INFO  L168              Benchmark]: TraceAbstraction took 76034.31 ms. Allocated memory was 398.5 MB in the beginning and 760.7 MB in the end (delta: 362.3 MB). Free memory was 312.5 MB in the beginning and 549.5 MB in the end (delta: -237.0 MB). Peak memory consumption was 125.3 MB. Max. memory is 5.3 GB.
[2018-02-02 09:29:31,183 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.10 ms. Allocated memory is still 398.5 MB. Free memory is still 359.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
 * CACSL2BoogieTranslator took 177.40 ms. Allocated memory is still 398.5 MB. Free memory was 352.4 MB in the beginning and 339.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 29.29 ms. Allocated memory is still 398.5 MB. Free memory was 339.2 MB in the beginning and 337.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
 * RCFGBuilder took 234.97 ms. Allocated memory is still 398.5 MB. Free memory was 337.9 MB in the beginning and 312.5 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB.
 * TraceAbstraction took 76034.31 ms. Allocated memory was 398.5 MB in the beginning and 760.7 MB in the end (delta: 362.3 MB). Free memory was 312.5 MB in the beginning and 549.5 MB in the end (delta: -237.0 MB). Peak memory consumption was 125.3 MB. Max. memory is 5.3 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
    Unable to prove that free always succeeds (line 1451). Cancelled  while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 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 (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 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 (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 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 (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 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 (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 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 (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 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 (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates.
  - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
    Unable to prove that free always succeeds (line 1451). Cancelled  while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates.
  - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction)
    Unable to prove that all allocated memory was freed (line 1478). Cancelled  while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates.
  - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
    Unable to prove that free always succeeds (line 1460). Cancelled  while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 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 (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates.
  - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
    Unable to prove that free always succeeds (line 1460). Cancelled  while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 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 (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 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 (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 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 (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates.
  - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
    Unable to prove that free always succeeds (line 1474). Cancelled  while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates.
  - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
    Unable to prove that free always succeeds (line 1474). Cancelled  while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 21 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates.
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 7 procedures, 76 locations, 17 error locations. TIMEOUT Result, 75.9s OverallTime, 19 OverallIterations, 11 TraceHistogramMax, 66.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1290 SDtfs, 927 SDslu, 7260 SDs, 0 SdLazy, 3478 SolverSat, 200 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 27.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 791 GetRequests, 501 SyntacticMatches, 4 SemanticMatches, 285 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1433 ImplicationChecksByTransitivity, 45.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=18, 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, 18 MinimizatonAttempts, 188 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1363 NumberOfCodeBlocks, 1291 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1333 ConstructedInterpolants, 72 QuantifiedInterpolants, 463505 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1753 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 893/1866 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_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-29-31-189.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-29-31-189.csv
Completed graceful shutdown