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_z3.epf -i ../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 10:57:44,606 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 10:57:44,607 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 10:57:44,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 10:57:44,619 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 10:57:44,620 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 10:57:44,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 10:57:44,622 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 10:57:44,624 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 10:57:44,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 10:57:44,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 10:57:44,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 10:57:44,626 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 10:57:44,627 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 10:57:44,628 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 10:57:44,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 10:57:44,631 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 10:57:44,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 10:57:44,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 10:57:44,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 10:57:44,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 10:57:44,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 10:57:44,637 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 10:57:44,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 10:57:44,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 10:57:44,640 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 10:57:44,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 10:57:44,641 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 10:57:44,641 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 10:57:44,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 10:57:44,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 10:57:44,642 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf
[2018-02-02 10:57:44,652 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 10:57:44,653 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 10:57:44,654 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 10:57:44,654 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 10:57:44,654 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 10:57:44,655 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 10:57:44,655 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 10:57:44,655 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 10:57:44,655 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 10:57:44,655 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 10:57:44,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 10:57:44,656 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 10:57:44,656 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 10:57:44,656 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 10:57:44,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 10:57:44,656 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 10:57:44,657 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 10:57:44,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 10:57:44,657 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 10:57:44,657 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 10:57:44,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:57:44,657 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 10:57:44,658 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2018-02-02 10:57:44,658 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode
[2018-02-02 10:57:44,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:44,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 10:57:44,703 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 10:57:44,706 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 10:57:44,708 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 10:57:44,709 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 10:57:44,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i
[2018-02-02 10:57:44,849 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 10:57:44,850 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 10:57:44,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 10:57:44,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 10:57:44,855 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 10:57:44,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:57:44" (1/1) ...
[2018-02-02 10:57:44,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59897e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:44, skipping insertion in model container
[2018-02-02 10:57:44,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:57:44" (1/1) ...
[2018-02-02 10:57:44,869 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:57:44,900 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:57:44,996 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:57:45,018 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:57:45,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:45 WrapperNode
[2018-02-02 10:57:45,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 10:57:45,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 10:57:45,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 10:57:45,028 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 10:57:45,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:45" (1/1) ...
[2018-02-02 10:57:45,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:45" (1/1) ...
[2018-02-02 10:57:45,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:45" (1/1) ...
[2018-02-02 10:57:45,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:45" (1/1) ...
[2018-02-02 10:57:45,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:45" (1/1) ...
[2018-02-02 10:57:45,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:45" (1/1) ...
[2018-02-02 10:57:45,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:45" (1/1) ...
[2018-02-02 10:57:45,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 10:57:45,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 10:57:45,064 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 10:57:45,064 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 10:57:45,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:45" (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 10:57:45,104 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 10:57:45,104 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 10:57:45,105 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model
[2018-02-02 10:57:45,105 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die
[2018-02-02 10:57:45,105 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert
[2018-02-02 10:57:45,105 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert
[2018-02-02 10:57:45,105 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert
[2018-02-02 10:57:45,105 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert
[2018-02-02 10:57:45,105 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert
[2018-02-02 10:57:45,105 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy
[2018-02-02 10:57:45,105 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy
[2018-02-02 10:57:45,105 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy
[2018-02-02 10:57:45,106 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy
[2018-02-02 10:57:45,106 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy
[2018-02-02 10:57:45,106 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 10:57:45,106 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-02 10:57:45,106 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-02 10:57:45,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 10:57:45,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 10:57:45,106 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 10:57:45,106 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset
[2018-02-02 10:57:45,106 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset
[2018-02-02 10:57:45,106 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 10:57:45,106 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-02 10:57:45,106 INFO L128 BoogieDeclarations]: Found specification of procedure abort
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure memset
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy
[2018-02-02 10:57:45,107 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy
[2018-02-02 10:57:45,108 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy
[2018-02-02 10:57:45,108 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy
[2018-02-02 10:57:45,108 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy
[2018-02-02 10:57:45,108 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 10:57:45,108 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 10:57:45,108 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 10:57:45,317 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2018-02-02 10:57:45,521 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 10:57:45,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:57:45 BoogieIcfgContainer
[2018-02-02 10:57:45,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 10:57:45,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 10:57:45,523 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 10:57:45,525 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 10:57:45,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:57:44" (1/3) ...
[2018-02-02 10:57:45,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2eb511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:57:45, skipping insertion in model container
[2018-02-02 10:57:45,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:57:45" (2/3) ...
[2018-02-02 10:57:45,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2eb511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:57:45, skipping insertion in model container
[2018-02-02 10:57:45,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:57:45" (3/3) ...
[2018-02-02 10:57:45,528 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0237_true-valid-memsafety.i
[2018-02-02 10:57:45,533 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-02 10:57:45,540 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations.
[2018-02-02 10:57:45,565 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 10:57:45,565 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 10:57:45,566 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2018-02-02 10:57:45,566 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-02 10:57:45,566 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 10:57:45,566 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 10:57:45,566 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 10:57:45,566 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 10:57:45,567 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 10:57:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states.
[2018-02-02 10:57:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2018-02-02 10:57:45,587 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:45,588 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2018-02-02 10:57:45,588 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash 12677088, now seen corresponding path program 1 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:45,602 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:45,640 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 10:57:45,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:57:45,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 10:57:45,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:45,661 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 10:57:45,661 INFO L182 omatonBuilderFactory]: Interpolants [253#true, 254#false, 255#(= 1 (select |#valid| |~#list~0.base|))]
[2018-02-02 10:57:45,661 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 10:57:45,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 10:57:45,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 10:57:45,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 10:57:45,673 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 3 states.
[2018-02-02 10:57:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:45,865 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions.
[2018-02-02 10:57:45,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 10:57:45,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4
[2018-02-02 10:57:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:45,877 INFO L225 Difference]: With dead ends: 279
[2018-02-02 10:57:45,878 INFO L226 Difference]: Without dead ends: 276
[2018-02-02 10:57:45,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:57:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states.
[2018-02-02 10:57:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 245.
[2018-02-02 10:57:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states.
[2018-02-02 10:57:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions.
[2018-02-02 10:57:45,979 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 4
[2018-02-02 10:57:45,979 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:45,979 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions.
[2018-02-02 10:57:45,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 10:57:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions.
[2018-02-02 10:57:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2018-02-02 10:57:45,980 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:45,980 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2018-02-02 10:57:45,980 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:45,980 INFO L82 PathProgramCache]: Analyzing trace with hash 12677089, now seen corresponding path program 1 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:45,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:46,001 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier
[2018-02-02 10:57:46,006 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,006 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,008 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,008 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,040 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true
[2018-02-02 10:57:46,072 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 10:57:46,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:57:46,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 10:57:46,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:46,101 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 10:57:46,101 INFO L182 omatonBuilderFactory]: Interpolants [780#true, 781#false, 782#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 783#(and (<= (+ |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (= 4 (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))]
[2018-02-02 10:57:46,101 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 10:57:46,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:57:46,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:57:46,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12
[2018-02-02 10:57:46,103 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 4 states.
[2018-02-02 10:57:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:46,231 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions.
[2018-02-02 10:57:46,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 10:57:46,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4
[2018-02-02 10:57:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:46,233 INFO L225 Difference]: With dead ends: 252
[2018-02-02 10:57:46,233 INFO L226 Difference]: Without dead ends: 252
[2018-02-02 10:57:46,234 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12
[2018-02-02 10:57:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states.
[2018-02-02 10:57:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 244.
[2018-02-02 10:57:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states.
[2018-02-02 10:57:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions.
[2018-02-02 10:57:46,247 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 4
[2018-02-02 10:57:46,247 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:46,247 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions.
[2018-02-02 10:57:46,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:57:46,247 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions.
[2018-02-02 10:57:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-02 10:57:46,248 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:46,248 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 10:57:46,248 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:46,248 INFO L82 PathProgramCache]: Analyzing trace with hash -144742640, now seen corresponding path program 1 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:46,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:46,270 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier
[2018-02-02 10:57:46,271 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,271 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,271 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,271 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,277 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) is different from true
[2018-02-02 10:57:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:46,298 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 10:57:46,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:57:46,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:57:46,315 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:46,315 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 10:57:46,316 INFO L182 omatonBuilderFactory]: Interpolants [1280#true, 1281#false, 1287#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 1288#(= 1 (select |#valid| |calloc_model_#t~malloc0.base|)), 1289#(= 1 (select |#valid| calloc_model_~ptr~0.base)), 1290#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))]
[2018-02-02 10:57:46,316 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 10:57:46,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:57:46,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:57:46,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30
[2018-02-02 10:57:46,317 INFO L87 Difference]: Start difference. First operand 244 states and 259 transitions. Second operand 6 states.
[2018-02-02 10:57:46,342 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_~#list~0.base| |c_old(~#list~0.base)|) (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) (= |c_#valid| |c_old(#valid)|) (= |c_~#list~0.offset| |c_old(~#list~0.offset)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false
[2018-02-02 10:57:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:46,809 INFO L93 Difference]: Finished difference Result 275 states and 296 transitions.
[2018-02-02 10:57:46,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:57:46,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2018-02-02 10:57:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:46,811 INFO L225 Difference]: With dead ends: 275
[2018-02-02 10:57:46,811 INFO L226 Difference]: Without dead ends: 275
[2018-02-02 10:57:46,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56
[2018-02-02 10:57:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states.
[2018-02-02 10:57:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 243.
[2018-02-02 10:57:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states.
[2018-02-02 10:57:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions.
[2018-02-02 10:57:46,822 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 17
[2018-02-02 10:57:46,822 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:46,822 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions.
[2018-02-02 10:57:46,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:57:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions.
[2018-02-02 10:57:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-02 10:57:46,823 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:46,823 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 10:57:46,823 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash -144742639, now seen corresponding path program 1 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
[2018-02-02 10:57:46,826 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:46,841 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier
WARNING: array quantifier
[2018-02-02 10:57:46,883 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,884 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,884 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,884 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,899 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,899 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,899 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:46,900 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:47,043 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 10:57:47,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:57:47,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-02 10:57:47,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:47,072 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 10:57:47,072 INFO L182 omatonBuilderFactory]: Interpolants [1824#(and (= 8 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (= 8 (select |#length| |calloc_model_#t~malloc0.base|)) (= 0 |calloc_model_#t~malloc0.offset|)), 1825#(and (<= 0 calloc_model_~ptr~0.offset) (or (and (< 2147483647 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (+ (select |#length| calloc_model_~ptr~0.base) 4294967296))) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (select |#length| calloc_model_~ptr~0.base)))), 1826#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1813#true, 1814#false, 1820#(= |zalloc_or_die_#in~size| 8), 1821#(= 8 zalloc_or_die_~size), 1822#(exists ((%0 (Array Int Int))) (! (and (= |calloc_model_#in~size| 8) (= |calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 8) (store |#length| %1 8)) :qid itp))) :qid itp)), 1823#(exists ((%0 (Array Int Int))) (! (and (= (ite (<= (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) 2147483647) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (+ (- 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))) 8) (forall ((%1 Int)) (! (= (store %0 %1 8) (store |#length| %1 8)) :qid itp))) :qid itp))]
[2018-02-02 10:57:47,072 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 10:57:47,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 10:57:47,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 10:57:47,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=56, Unknown=1, NotChecked=0, Total=72
[2018-02-02 10:57:47,073 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 9 states.
[2018-02-02 10:57:47,147 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_~#list~0.base| |c_old(~#list~0.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((%0 (Array Int Int))) (! (and (= |c_calloc_model_#in~size| 8) (= |c_calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 8) (store |c_#length| %1 8)) :qid itp))) :qid itp)) (= |c_~#list~0.offset| |c_old(~#list~0.offset)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false
[2018-02-02 10:57:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:47,934 INFO L93 Difference]: Finished difference Result 288 states and 310 transitions.
[2018-02-02 10:57:47,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-02 10:57:47,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17
[2018-02-02 10:57:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:47,936 INFO L225 Difference]: With dead ends: 288
[2018-02-02 10:57:47,936 INFO L226 Difference]: Without dead ends: 288
[2018-02-02 10:57:47,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=121, Unknown=3, NotChecked=22, Total=182
[2018-02-02 10:57:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states.
[2018-02-02 10:57:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 256.
[2018-02-02 10:57:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2018-02-02 10:57:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 271 transitions.
[2018-02-02 10:57:47,942 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 271 transitions. Word has length 17
[2018-02-02 10:57:47,943 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:47,943 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 271 transitions.
[2018-02-02 10:57:47,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 10:57:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 271 transitions.
[2018-02-02 10:57:47,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-02-02 10:57:47,944 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:47,944 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:57:47,944 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:47,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1020493077, now seen corresponding path program 1 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:47,947 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:48,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:57:48,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-02-02 10:57:48,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:48,204 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 10:57:48,205 INFO L182 omatonBuilderFactory]: Interpolants [2421#(not (= 8 |zalloc_or_die_#in~size|)), 2406#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2422#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 2407#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2408#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 2428#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 2381#true, 2429#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2382#false, 2430#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 2431#(<= |#Ultimate.C_memset_#amount| 0)]
[2018-02-02 10:57:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:48,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:57:48,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:57:48,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:57:48,206 INFO L87 Difference]: Start difference. First operand 256 states and 271 transitions. Second operand 11 states.
[2018-02-02 10:57:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:49,307 INFO L93 Difference]: Finished difference Result 316 states and 346 transitions.
[2018-02-02 10:57:49,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 10:57:49,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40
[2018-02-02 10:57:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:49,309 INFO L225 Difference]: With dead ends: 316
[2018-02-02 10:57:49,310 INFO L226 Difference]: Without dead ends: 309
[2018-02-02 10:57:49,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:57:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states.
[2018-02-02 10:57:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 259.
[2018-02-02 10:57:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states.
[2018-02-02 10:57:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 275 transitions.
[2018-02-02 10:57:49,320 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 275 transitions. Word has length 40
[2018-02-02 10:57:49,320 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:49,320 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 275 transitions.
[2018-02-02 10:57:49,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:57:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 275 transitions.
[2018-02-02 10:57:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-02-02 10:57:49,322 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:49,322 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:57:49,322 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:49,322 INFO L82 PathProgramCache]: Analyzing trace with hash -569439612, now seen corresponding path program 1 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:49,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:49,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:57:49,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:57:49,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:49,508 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 10:57:49,509 INFO L182 omatonBuilderFactory]: Interpolants [3027#true, 3028#false, 3077#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 3078#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3079#(= |#Ultimate.C_memset_#t~loopctr48| 0), 3080#(or (and (< |#Ultimate.C_memset_#t~loopctr48| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| 1) (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr48|))), 3081#(<= |#Ultimate.C_memset_#amount| 1), 3053#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3069#(not (= 8 |zalloc_or_die_#in~size|)), 3054#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3070#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 3055#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8)))]
[2018-02-02 10:57:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:49,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-02 10:57:49,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-02 10:57:49,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:57:49,510 INFO L87 Difference]: Start difference. First operand 259 states and 275 transitions. Second operand 12 states.
[2018-02-02 10:57:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:50,396 INFO L93 Difference]: Finished difference Result 322 states and 353 transitions.
[2018-02-02 10:57:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 10:57:50,396 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41
[2018-02-02 10:57:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:50,397 INFO L225 Difference]: With dead ends: 322
[2018-02-02 10:57:50,397 INFO L226 Difference]: Without dead ends: 315
[2018-02-02 10:57:50,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:57:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states.
[2018-02-02 10:57:50,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 260.
[2018-02-02 10:57:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states.
[2018-02-02 10:57:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 277 transitions.
[2018-02-02 10:57:50,403 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 277 transitions. Word has length 41
[2018-02-02 10:57:50,403 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:50,403 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 277 transitions.
[2018-02-02 10:57:50,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-02 10:57:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 277 transitions.
[2018-02-02 10:57:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-02 10:57:50,404 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:50,404 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:57:50,404 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:50,405 INFO L82 PathProgramCache]: Analyzing trace with hash 528315915, now seen corresponding path program 2 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:50,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:50,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:57:50,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2018-02-02 10:57:50,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:50,588 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 10:57:50,588 INFO L182 omatonBuilderFactory]: Interpolants [3744#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 3745#(or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr48| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#amount| 2))), 3746#(<= |#Ultimate.C_memset_#amount| 2), 3715#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3716#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3717#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 3688#true, 3689#false, 3732#(not (= 8 |zalloc_or_die_#in~size|)), 3733#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 3741#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 3742#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3743#(= 0 |#Ultimate.C_memset_#t~loopctr48|)]
[2018-02-02 10:57:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:50,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:57:50,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:57:50,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:57:50,589 INFO L87 Difference]: Start difference. First operand 260 states and 277 transitions. Second operand 13 states.
[2018-02-02 10:57:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:51,649 INFO L93 Difference]: Finished difference Result 325 states and 357 transitions.
[2018-02-02 10:57:51,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-02-02 10:57:51,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42
[2018-02-02 10:57:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:51,651 INFO L225 Difference]: With dead ends: 325
[2018-02-02 10:57:51,651 INFO L226 Difference]: Without dead ends: 318
[2018-02-02 10:57:51,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650
[2018-02-02 10:57:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2018-02-02 10:57:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 261.
[2018-02-02 10:57:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states.
[2018-02-02 10:57:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 279 transitions.
[2018-02-02 10:57:51,661 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 279 transitions. Word has length 42
[2018-02-02 10:57:51,661 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:51,661 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 279 transitions.
[2018-02-02 10:57:51,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:57:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 279 transitions.
[2018-02-02 10:57:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-02-02 10:57:51,662 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:51,665 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, 1, 1, 1, 1, 1]
[2018-02-02 10:57:51,665 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash 198998884, now seen corresponding path program 3 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:51,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:51,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:57:51,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-02 10:57:51,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:51,879 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 10:57:51,879 INFO L182 omatonBuilderFactory]: Interpolants [4416#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4417#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 4418#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 4387#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4419#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 4388#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4420#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 4389#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 4421#(not (= 8 |#Ultimate.C_memset_#amount|)), 4359#true, 4360#false, 4405#(not (= 8 |zalloc_or_die_#in~size|)), 4406#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 4415#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8))]
[2018-02-02 10:57:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:51,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-02 10:57:51,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-02 10:57:51,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:57:51,881 INFO L87 Difference]: Start difference. First operand 261 states and 279 transitions. Second operand 14 states.
[2018-02-02 10:57:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:52,855 INFO L93 Difference]: Finished difference Result 328 states and 361 transitions.
[2018-02-02 10:57:52,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:57:52,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43
[2018-02-02 10:57:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:52,858 INFO L225 Difference]: With dead ends: 328
[2018-02-02 10:57:52,858 INFO L226 Difference]: Without dead ends: 321
[2018-02-02 10:57:52,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756
[2018-02-02 10:57:52,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states.
[2018-02-02 10:57:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262.
[2018-02-02 10:57:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states.
[2018-02-02 10:57:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 281 transitions.
[2018-02-02 10:57:52,868 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 281 transitions. Word has length 43
[2018-02-02 10:57:52,868 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:52,868 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 281 transitions.
[2018-02-02 10:57:52,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-02 10:57:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 281 transitions.
[2018-02-02 10:57:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-02 10:57:52,869 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:52,869 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:57:52,869 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1419894485, now seen corresponding path program 4 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:52,872 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:53,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:57:53,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:57:53,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:53,087 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 10:57:53,087 INFO L182 omatonBuilderFactory]: Interpolants [5088#(not (= 8 |zalloc_or_die_#in~size|)), 5089#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 5099#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 5100#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5069#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5101#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 5070#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5102#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 5071#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 5103#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 5040#true, 5104#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 5041#false, 5105#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 5106#(not (= 8 |#Ultimate.C_memset_#amount|))]
[2018-02-02 10:57:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:53,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:57:53,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:57:53,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:57:53,088 INFO L87 Difference]: Start difference. First operand 262 states and 281 transitions. Second operand 15 states.
[2018-02-02 10:57:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:54,035 INFO L93 Difference]: Finished difference Result 331 states and 365 transitions.
[2018-02-02 10:57:54,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-02-02 10:57:54,035 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44
[2018-02-02 10:57:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:54,037 INFO L225 Difference]: With dead ends: 331
[2018-02-02 10:57:54,037 INFO L226 Difference]: Without dead ends: 324
[2018-02-02 10:57:54,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870
[2018-02-02 10:57:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states.
[2018-02-02 10:57:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 263.
[2018-02-02 10:57:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states.
[2018-02-02 10:57:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 283 transitions.
[2018-02-02 10:57:54,044 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 283 transitions. Word has length 44
[2018-02-02 10:57:54,044 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:54,044 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 283 transitions.
[2018-02-02 10:57:54,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:57:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 283 transitions.
[2018-02-02 10:57:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-02-02 10:57:54,045 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:54,045 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:57:54,045 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash -65981372, now seen corresponding path program 5 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:54,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:54,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:57:54,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:57:54,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:54,262 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 10:57:54,262 INFO L182 omatonBuilderFactory]: Interpolants [5761#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5793#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 5762#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5794#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5731#true, 5763#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 5795#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 5732#false, 5796#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 5797#(= |#Ultimate.C_memset_#t~loopctr48| 2), 5798#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 5799#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 5800#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 5801#(not (= 8 |#Ultimate.C_memset_#amount|)), 5781#(not (= 8 |zalloc_or_die_#in~size|)), 5782#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))]
[2018-02-02 10:57:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:54,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:57:54,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:57:54,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:57:54,263 INFO L87 Difference]: Start difference. First operand 263 states and 283 transitions. Second operand 16 states.
[2018-02-02 10:57:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:55,393 INFO L93 Difference]: Finished difference Result 334 states and 369 transitions.
[2018-02-02 10:57:55,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-02-02 10:57:55,393 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45
[2018-02-02 10:57:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:55,395 INFO L225 Difference]: With dead ends: 334
[2018-02-02 10:57:55,395 INFO L226 Difference]: Without dead ends: 327
[2018-02-02 10:57:55,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992
[2018-02-02 10:57:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states.
[2018-02-02 10:57:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 264.
[2018-02-02 10:57:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states.
[2018-02-02 10:57:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 285 transitions.
[2018-02-02 10:57:55,401 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 285 transitions. Word has length 45
[2018-02-02 10:57:55,402 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:55,402 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 285 transitions.
[2018-02-02 10:57:55,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:57:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 285 transitions.
[2018-02-02 10:57:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2018-02-02 10:57:55,402 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:55,402 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:57:55,403 INFO L371 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1044347829, now seen corresponding path program 6 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:55,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:55,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:57:55,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2018-02-02 10:57:55,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:55,622 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 10:57:55,622 INFO L182 omatonBuilderFactory]: Interpolants [6432#true, 6464#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6433#false, 6465#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 6497#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 6498#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6499#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 6500#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 6501#(= |#Ultimate.C_memset_#t~loopctr48| 2), 6502#(= |#Ultimate.C_memset_#t~loopctr48| 3), 6503#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 6504#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 6505#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 6506#(not (= 8 |#Ultimate.C_memset_#amount|)), 6484#(not (= 8 |zalloc_or_die_#in~size|)), 6485#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 6463#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))]
[2018-02-02 10:57:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:55,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 10:57:55,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 10:57:55,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:57:55,622 INFO L87 Difference]: Start difference. First operand 264 states and 285 transitions. Second operand 17 states.
[2018-02-02 10:57:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:56,816 INFO L93 Difference]: Finished difference Result 337 states and 373 transitions.
[2018-02-02 10:57:56,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 10:57:56,816 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46
[2018-02-02 10:57:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:56,817 INFO L225 Difference]: With dead ends: 337
[2018-02-02 10:57:56,817 INFO L226 Difference]: Without dead ends: 330
[2018-02-02 10:57:56,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122
[2018-02-02 10:57:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states.
[2018-02-02 10:57:56,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 265.
[2018-02-02 10:57:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states.
[2018-02-02 10:57:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 287 transitions.
[2018-02-02 10:57:56,823 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 287 transitions. Word has length 46
[2018-02-02 10:57:56,823 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:56,823 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 287 transitions.
[2018-02-02 10:57:56,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 10:57:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 287 transitions.
[2018-02-02 10:57:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-02-02 10:57:56,824 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:56,824 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:57:56,824 INFO L371 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:56,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1308936924, now seen corresponding path program 7 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:56,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:57,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:57:57,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:57:57,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:57,053 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 10:57:57,053 INFO L182 omatonBuilderFactory]: Interpolants [7143#true, 7175#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7144#false, 7176#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7177#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 7211#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 7212#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7213#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 7214#(<= |#Ultimate.C_memset_#t~loopctr48| 1), 7215#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 7216#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 7217#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 7218#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 7219#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 7220#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 7221#(not (= 8 |#Ultimate.C_memset_#amount|)), 7197#(not (= 8 |zalloc_or_die_#in~size|)), 7198#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))]
[2018-02-02 10:57:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:57:57,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 10:57:57,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 10:57:57,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:57:57,054 INFO L87 Difference]: Start difference. First operand 265 states and 287 transitions. Second operand 18 states.
[2018-02-02 10:57:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:58,252 INFO L93 Difference]: Finished difference Result 340 states and 377 transitions.
[2018-02-02 10:57:58,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 10:57:58,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47
[2018-02-02 10:57:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:58,254 INFO L225 Difference]: With dead ends: 340
[2018-02-02 10:57:58,254 INFO L226 Difference]: Without dead ends: 333
[2018-02-02 10:57:58,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260
[2018-02-02 10:57:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states.
[2018-02-02 10:57:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 266.
[2018-02-02 10:57:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states.
[2018-02-02 10:57:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 289 transitions.
[2018-02-02 10:57:58,260 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 289 transitions. Word has length 47
[2018-02-02 10:57:58,260 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:58,260 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 289 transitions.
[2018-02-02 10:57:58,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 10:57:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 289 transitions.
[2018-02-02 10:57:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 10:57:58,261 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:58,261 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:57:58,261 INFO L371 AbstractCegarLoop]: === Iteration 13 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash -921264277, now seen corresponding path program 8 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:58,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:58,286 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier
WARNING: array quantifier
WARNING: array quantifier
[2018-02-02 10:57:58,300 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:58,300 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:58,300 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:58,300 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:58,308 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:58,308 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:58,308 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:58,308 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)]
[2018-02-02 10:57:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2018-02-02 10:57:58,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:57:58,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-02-02 10:57:58,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:58,470 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 10:57:58,470 INFO L182 omatonBuilderFactory]: Interpolants [7904#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7938#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7864#true, 7865#false, 7897#(= |zalloc_or_die_#in~size| 12), 7898#(= 12 zalloc_or_die_~size), 7899#(exists ((%0 (Array Int Int))) (! (and (= |calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 12) (store |#length| %1 12)) :qid itp)) (= |calloc_model_#in~size| 12)) :qid itp)), 7900#(exists ((%0 (Array Int Int))) (! (and (= (ite (<= (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) 2147483647) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (+ (- 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))) 12) (forall ((%1 Int)) (! (= (store %0 %1 12) (store |#length| %1 12)) :qid itp))) :qid itp)), 7901#(and (= 12 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (= 0 |calloc_model_#t~malloc0.offset|) (= 12 (select |#length| |calloc_model_#t~malloc0.base|))), 7902#(and (<= 0 calloc_model_~ptr~0.offset) (or (and (< 2147483647 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (+ (select |#length| calloc_model_~ptr~0.base) 4294967296))) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (select |#length| calloc_model_~ptr~0.base)))), 7903#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))]
[2018-02-02 10:57:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2018-02-02 10:57:58,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:57:58,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:57:58,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=86, Unknown=2, NotChecked=0, Total=110
[2018-02-02 10:57:58,470 INFO L87 Difference]: Start difference. First operand 266 states and 289 transitions. Second operand 11 states.
[2018-02-02 10:57:58,611 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_~#list~0.base| |c_old(~#list~0.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_~#list~0.offset| |c_old(~#list~0.offset)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (exists ((%0 (Array Int Int))) (! (and (= |c_calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 12) (store |c_#length| %1 12)) :qid itp)) (= |c_calloc_model_#in~size| 12)) :qid itp)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((%0 (Array Int Int))) (! (and (= (let ((.cse0 (mod (* (mod c_calloc_model_~nmemb 4294967296) (mod c_calloc_model_~size 4294967296)) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 12) (forall ((%1 Int)) (! (= (store %0 %1 12) (store |c_#length| %1 12)) :qid itp))) :qid itp))) is different from false
[2018-02-02 10:57:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:57:59,199 INFO L93 Difference]: Finished difference Result 317 states and 347 transitions.
[2018-02-02 10:57:59,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 10:57:59,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48
[2018-02-02 10:57:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:57:59,201 INFO L225 Difference]: With dead ends: 317
[2018-02-02 10:57:59,201 INFO L226 Difference]: Without dead ends: 317
[2018-02-02 10:57:59,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=184, Unknown=7, NotChecked=28, Total=272
[2018-02-02 10:57:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states.
[2018-02-02 10:57:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 279.
[2018-02-02 10:57:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states.
[2018-02-02 10:57:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 303 transitions.
[2018-02-02 10:57:59,208 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 303 transitions. Word has length 48
[2018-02-02 10:57:59,208 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:57:59,208 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 303 transitions.
[2018-02-02 10:57:59,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:57:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 303 transitions.
[2018-02-02 10:57:59,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2018-02-02 10:57:59,210 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:57:59,210 INFO L351 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:57:59,210 INFO L371 AbstractCegarLoop]: === Iteration 14 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:57:59,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2128145214, now seen corresponding path program 1 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:57:59,214 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:57:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:57:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked.
[2018-02-02 10:57:59,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:57:59,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-02-02 10:57:59,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:57:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2018-02-02 10:57:59,462 INFO L182 omatonBuilderFactory]: Interpolants [8752#(not (= 12 |zalloc_or_die_#in~size|)), 8753#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 8547#true, 8739#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 8548#false, 8759#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 8760#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 8761#(<= |#Ultimate.C_memset_#amount| 0), 8652#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8653#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8687#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))]
[2018-02-02 10:57:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked.
[2018-02-02 10:57:59,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:57:59,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:57:59,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:57:59,463 INFO L87 Difference]: Start difference. First operand 279 states and 303 transitions. Second operand 11 states.
[2018-02-02 10:58:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:58:00,192 INFO L93 Difference]: Finished difference Result 324 states and 353 transitions.
[2018-02-02 10:58:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 10:58:00,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 137
[2018-02-02 10:58:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:58:00,194 INFO L225 Difference]: With dead ends: 324
[2018-02-02 10:58:00,194 INFO L226 Difference]: Without dead ends: 317
[2018-02-02 10:58:00,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420
[2018-02-02 10:58:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states.
[2018-02-02 10:58:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 281.
[2018-02-02 10:58:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states.
[2018-02-02 10:58:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions.
[2018-02-02 10:58:00,199 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 137
[2018-02-02 10:58:00,199 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:58:00,199 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions.
[2018-02-02 10:58:00,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:58:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions.
[2018-02-02 10:58:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2018-02-02 10:58:00,200 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:58:00,200 INFO L351 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:58:00,200 INFO L371 AbstractCegarLoop]: === Iteration 15 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:58:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash -501524986, now seen corresponding path program 2 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:58:00,214 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:58:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 61 proven. 52 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked.
[2018-02-02 10:58:00,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:58:00,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:58:00,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:58:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked.
[2018-02-02 10:58:00,442 INFO L182 omatonBuilderFactory]: Interpolants [9555#(or (not (= |calloc_model_#in~size| 12)) (not (= |calloc_model_#in~nmemb| 1))), 9556#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 9557#(or (and (< |#Ultimate.C_memset_#t~loopctr48| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| 1) (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr48|))), 9558#(<= |#Ultimate.C_memset_#amount| 1), 9497#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9498#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9547#(not (= 12 |zalloc_or_die_#in~size|)), 9388#true, 9532#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9548#(and (= calloc_model_~size |calloc_model_#in~size|) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 9389#false, 9533#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12))))]
[2018-02-02 10:58:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 61 proven. 52 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked.
[2018-02-02 10:58:00,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-02 10:58:00,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-02 10:58:00,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:58:00,443 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 12 states.
[2018-02-02 10:58:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:58:01,267 INFO L93 Difference]: Finished difference Result 326 states and 355 transitions.
[2018-02-02 10:58:01,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-02-02 10:58:01,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141
[2018-02-02 10:58:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:58:01,268 INFO L225 Difference]: With dead ends: 326
[2018-02-02 10:58:01,268 INFO L226 Difference]: Without dead ends: 319
[2018-02-02 10:58:01,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650
[2018-02-02 10:58:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states.
[2018-02-02 10:58:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 281.
[2018-02-02 10:58:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states.
[2018-02-02 10:58:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions.
[2018-02-02 10:58:01,274 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 141
[2018-02-02 10:58:01,274 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:58:01,274 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions.
[2018-02-02 10:58:01,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-02 10:58:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions.
[2018-02-02 10:58:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2018-02-02 10:58:01,276 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:58:01,276 INFO L351 BasicCegarLoop]: trace histogram [16, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:58:01,276 INFO L371 AbstractCegarLoop]: === Iteration 16 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:58:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash -897071938, now seen corresponding path program 3 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:58:01,283 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:58:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 70 proven. 69 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked.
[2018-02-02 10:58:01,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:58:01,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2018-02-02 10:58:01,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:58:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked.
[2018-02-02 10:58:01,470 INFO L182 omatonBuilderFactory]: Interpolants [10400#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10401#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 10252#true, 10253#false, 10416#(not (= 12 |zalloc_or_die_#in~size|)), 10417#(and (= calloc_model_~size |calloc_model_#in~size|) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 10425#(or (not (= |calloc_model_#in~size| 12)) (not (= |calloc_model_#in~nmemb| 1))), 10426#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 10427#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 10428#(or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr48| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#amount| 2))), 10365#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10429#(<= |#Ultimate.C_memset_#amount| 2), 10366#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))]
[2018-02-02 10:58:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 70 proven. 69 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked.
[2018-02-02 10:58:01,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:58:01,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:58:01,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:58:01,470 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 13 states.
[2018-02-02 10:58:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:58:02,263 INFO L93 Difference]: Finished difference Result 328 states and 357 transitions.
[2018-02-02 10:58:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:58:02,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 145
[2018-02-02 10:58:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:58:02,265 INFO L225 Difference]: With dead ends: 328
[2018-02-02 10:58:02,265 INFO L226 Difference]: Without dead ends: 321
[2018-02-02 10:58:02,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756
[2018-02-02 10:58:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states.
[2018-02-02 10:58:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 281.
[2018-02-02 10:58:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states.
[2018-02-02 10:58:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions.
[2018-02-02 10:58:02,269 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 145
[2018-02-02 10:58:02,269 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:58:02,269 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions.
[2018-02-02 10:58:02,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:58:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions.
[2018-02-02 10:58:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2018-02-02 10:58:02,270 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:58:02,270 INFO L351 BasicCegarLoop]: trace histogram [20, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:58:02,270 INFO L371 AbstractCegarLoop]: === Iteration 17 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:58:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2110093178, now seen corresponding path program 4 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:58:02,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:58:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,611 WARN L146 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 40 DAG size of output 22
[2018-02-02 10:58:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 79 proven. 93 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked.
[2018-02-02 10:58:02,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:58:02,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-02 10:58:02,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:58:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2018-02-02 10:58:02,741 INFO L182 omatonBuilderFactory]: Interpolants [11302#(not (= 12 |zalloc_or_die_#in~size|)), 11303#(and (= (mod (* (mod |calloc_model_#in~size| 4294967296) (mod calloc_model_~nmemb 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 11312#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 11313#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 11250#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11314#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 11251#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11315#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 11316#(and (< 2 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 11285#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11317#(and (< 2 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3)), 11286#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 11133#true, 11134#false]
[2018-02-02 10:58:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 79 proven. 93 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked.
[2018-02-02 10:58:02,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-02 10:58:02,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-02 10:58:02,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:58:02,742 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 14 states.
[2018-02-02 10:58:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:58:05,923 INFO L93 Difference]: Finished difference Result 333 states and 362 transitions.
[2018-02-02 10:58:05,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 10:58:05,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149
[2018-02-02 10:58:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:58:05,924 INFO L225 Difference]: With dead ends: 333
[2018-02-02 10:58:05,925 INFO L226 Difference]: Without dead ends: 326
[2018-02-02 10:58:05,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:58:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states.
[2018-02-02 10:58:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 281.
[2018-02-02 10:58:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states.
[2018-02-02 10:58:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions.
[2018-02-02 10:58:05,929 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 149
[2018-02-02 10:58:05,930 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:58:05,930 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions.
[2018-02-02 10:58:05,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-02 10:58:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions.
[2018-02-02 10:58:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2018-02-02 10:58:05,931 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:58:05,931 INFO L351 BasicCegarLoop]: trace histogram [24, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:58:05,931 INFO L371 AbstractCegarLoop]: === Iteration 18 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:58:05,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1031642686, now seen corresponding path program 5 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
[2018-02-02 10:58:05,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:58:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 88 proven. 124 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked.
[2018-02-02 10:58:06,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:58:06,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:58:06,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:58:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 5 proven. 54 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2018-02-02 10:58:06,269 INFO L182 omatonBuilderFactory]: Interpolants [12196#(not (= 12 |zalloc_or_die_#in~size|)), 12197#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 12143#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12207#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 12144#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12208#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 12209#(<= |#Ultimate.C_memset_#t~loopctr48| 1), 12178#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12210#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 12179#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 12211#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 12212#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 12213#(not (= 12 |#Ultimate.C_memset_#amount|)), 12022#true, 12023#false]
[2018-02-02 10:58:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 88 proven. 124 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked.
[2018-02-02 10:58:06,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:58:06,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:58:06,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:58:06,269 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 15 states.
[2018-02-02 10:58:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:58:07,238 INFO L93 Difference]: Finished difference Result 335 states and 364 transitions.
[2018-02-02 10:58:07,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-02-02 10:58:07,238 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153
[2018-02-02 10:58:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:58:07,239 INFO L225 Difference]: With dead ends: 335
[2018-02-02 10:58:07,239 INFO L226 Difference]: Without dead ends: 328
[2018-02-02 10:58:07,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870
[2018-02-02 10:58:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states.
[2018-02-02 10:58:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 281.
[2018-02-02 10:58:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states.
[2018-02-02 10:58:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions.
[2018-02-02 10:58:07,243 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 153
[2018-02-02 10:58:07,243 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:58:07,243 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions.
[2018-02-02 10:58:07,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:58:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions.
[2018-02-02 10:58:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2018-02-02 10:58:07,244 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:58:07,244 INFO L351 BasicCegarLoop]: trace histogram [28, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:58:07,244 INFO L371 AbstractCegarLoop]: === Iteration 19 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:58:07,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1389217018, now seen corresponding path program 6 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:58:07,247 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:58:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:07,951 WARN L146 SmtUtils]: Spent 598ms on a formula simplification. DAG size of input: 40 DAG size of output 22
[2018-02-02 10:58:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 97 proven. 162 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked.
[2018-02-02 10:58:08,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:58:08,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:58:08,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:58:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked.
[2018-02-02 10:58:08,115 INFO L182 omatonBuilderFactory]: Interpolants [13061#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13062#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13127#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 12936#true, 13096#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13128#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 12937#false, 13097#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 13129#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 13130#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|)), 13131#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3) (< 1 |#Ultimate.C_memset_#amount|)), 13132#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 13133#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 13134#(and (< 1 |#Ultimate.C_memset_#amount|) (<= 0 (+ (div (+ (- 17179869149) (* (- 7) |#Ultimate.C_memset_#amount|)) 4294967296) 5))), 13115#(not (= 12 |zalloc_or_die_#in~size|)), 13116#(and (= (mod (* (mod |calloc_model_#in~size| 4294967296) (mod calloc_model_~nmemb 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1))))]
[2018-02-02 10:58:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 97 proven. 162 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked.
[2018-02-02 10:58:08,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:58:08,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:58:08,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:58:08,115 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 16 states.
[2018-02-02 10:58:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:58:23,302 INFO L93 Difference]: Finished difference Result 337 states and 366 transitions.
[2018-02-02 10:58:23,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-02-02 10:58:23,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 157
[2018-02-02 10:58:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:58:23,303 INFO L225 Difference]: With dead ends: 337
[2018-02-02 10:58:23,304 INFO L226 Difference]: Without dead ends: 330
[2018-02-02 10:58:23,304 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812
[2018-02-02 10:58:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states.
[2018-02-02 10:58:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 281.
[2018-02-02 10:58:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states.
[2018-02-02 10:58:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions.
[2018-02-02 10:58:23,308 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 157
[2018-02-02 10:58:23,309 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:58:23,309 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions.
[2018-02-02 10:58:23,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:58:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions.
[2018-02-02 10:58:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2018-02-02 10:58:23,309 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:58:23,310 INFO L351 BasicCegarLoop]: trace histogram [32, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:58:23,310 INFO L371 AbstractCegarLoop]: === Iteration 20 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:58:23,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2117236670, now seen corresponding path program 7 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:58:23,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:58:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 106 proven. 207 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked.
[2018-02-02 10:58:23,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:58:23,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2018-02-02 10:58:23,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:58:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 7 proven. 60 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked.
[2018-02-02 10:58:23,649 INFO L182 omatonBuilderFactory]: Interpolants [13861#true, 13862#false, 13990#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13991#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14025#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14026#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 14058#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 14059#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 14060#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 14061#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 14062#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 14063#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 14064#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 14065#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 14066#(not (= |#Ultimate.C_memset_#amount| 12)), 14045#(not (= 12 |zalloc_or_die_#in~size|)), 14046#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))]
[2018-02-02 10:58:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 106 proven. 207 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked.
[2018-02-02 10:58:23,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 10:58:23,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 10:58:23,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:58:23,650 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 17 states.
[2018-02-02 10:58:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:58:24,874 INFO L93 Difference]: Finished difference Result 339 states and 368 transitions.
[2018-02-02 10:58:24,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 10:58:24,874 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 161
[2018-02-02 10:58:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:58:24,875 INFO L225 Difference]: With dead ends: 339
[2018-02-02 10:58:24,875 INFO L226 Difference]: Without dead ends: 332
[2018-02-02 10:58:24,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122
[2018-02-02 10:58:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states.
[2018-02-02 10:58:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 281.
[2018-02-02 10:58:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states.
[2018-02-02 10:58:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions.
[2018-02-02 10:58:24,881 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 161
[2018-02-02 10:58:24,882 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:58:24,882 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions.
[2018-02-02 10:58:24,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 10:58:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions.
[2018-02-02 10:58:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2018-02-02 10:58:24,883 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:58:24,883 INFO L351 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:58:24,883 INFO L371 AbstractCegarLoop]: === Iteration 21 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:58:24,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1531604358, now seen corresponding path program 8 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:58:24,889 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:58:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,658 WARN L146 SmtUtils]: Spent 656ms on a formula simplification. DAG size of input: 40 DAG size of output 22
[2018-02-02 10:58:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 115 proven. 259 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked.
[2018-02-02 10:58:25,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:58:25,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:58:25,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:58:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked.
[2018-02-02 10:58:25,883 INFO L182 omatonBuilderFactory]: Interpolants [14977#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14978#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 15012#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 15013#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 15014#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 15015#(and (= |#Ultimate.C_memset_#t~loopctr48| 2) (< 1 |#Ultimate.C_memset_#amount|)), 15016#(and (<= |#Ultimate.C_memset_#t~loopctr48| 3) (< 1 |#Ultimate.C_memset_#amount|)), 15017#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 15018#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 15019#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (< 1 |#Ultimate.C_memset_#amount|)), 15020#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 15021#(and (<= |#Ultimate.C_memset_#amount| 7) (< 1 |#Ultimate.C_memset_#amount|)), 14998#(not (= 12 |zalloc_or_die_#in~size|)), 14999#(and (= (mod (* (mod |calloc_model_#in~size| 4294967296) (mod calloc_model_~nmemb 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 14809#true, 14810#false, 14942#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14943#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))]
[2018-02-02 10:58:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 115 proven. 259 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked.
[2018-02-02 10:58:25,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 10:58:25,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 10:58:25,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:58:25,884 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 18 states.
[2018-02-02 10:58:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:58:27,786 INFO L93 Difference]: Finished difference Result 339 states and 367 transitions.
[2018-02-02 10:58:27,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-02-02 10:58:27,786 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 165
[2018-02-02 10:58:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:58:27,787 INFO L225 Difference]: With dead ends: 339
[2018-02-02 10:58:27,787 INFO L226 Difference]: Without dead ends: 332
[2018-02-02 10:58:27,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 10:58:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states.
[2018-02-02 10:58:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 279.
[2018-02-02 10:58:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states.
[2018-02-02 10:58:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 302 transitions.
[2018-02-02 10:58:27,792 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 302 transitions. Word has length 165
[2018-02-02 10:58:27,792 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:58:27,792 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 302 transitions.
[2018-02-02 10:58:27,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 10:58:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 302 transitions.
[2018-02-02 10:58:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2018-02-02 10:58:27,793 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:58:27,793 INFO L351 BasicCegarLoop]: trace histogram [40, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:58:27,793 INFO L371 AbstractCegarLoop]: === Iteration 22 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:58:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1864257854, now seen corresponding path program 9 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:58:27,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:58:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 124 proven. 318 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked.
[2018-02-02 10:58:28,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:58:28,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-02 10:58:28,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:58:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 11 proven. 66 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked.
[2018-02-02 10:58:28,153 INFO L182 omatonBuilderFactory]: Interpolants [15936#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15937#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 15973#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 15974#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 15975#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 15976#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 15977#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 15978#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 15979#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 15980#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 15981#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 15982#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 15983#(not (= 12 |#Ultimate.C_memset_#amount|)), 15764#true, 15765#false, 15958#(not (= 12 |zalloc_or_die_#in~size|)), 15959#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 15901#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15902#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))]
[2018-02-02 10:58:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 124 proven. 318 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked.
[2018-02-02 10:58:28,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:58:28,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:58:28,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:58:28,154 INFO L87 Difference]: Start difference. First operand 279 states and 302 transitions. Second operand 19 states.
[2018-02-02 10:58:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:58:29,345 INFO L93 Difference]: Finished difference Result 345 states and 375 transitions.
[2018-02-02 10:58:29,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-02-02 10:58:29,345 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 169
[2018-02-02 10:58:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:58:29,346 INFO L225 Difference]: With dead ends: 345
[2018-02-02 10:58:29,346 INFO L226 Difference]: Without dead ends: 338
[2018-02-02 10:58:29,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406
[2018-02-02 10:58:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states.
[2018-02-02 10:58:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 282.
[2018-02-02 10:58:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states.
[2018-02-02 10:58:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 307 transitions.
[2018-02-02 10:58:29,351 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 307 transitions. Word has length 169
[2018-02-02 10:58:29,351 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:58:29,351 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 307 transitions.
[2018-02-02 10:58:29,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:58:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 307 transitions.
[2018-02-02 10:58:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2018-02-02 10:58:29,352 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:58:29,352 INFO L351 BasicCegarLoop]: trace histogram [44, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:58:29,353 INFO L371 AbstractCegarLoop]: === Iteration 23 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]===
[2018-02-02 10:58:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1463083002, now seen corresponding path program 10 times
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-02-02 10:58:29,360 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:58:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:30,061 WARN L146 SmtUtils]: Spent 593ms on a formula simplification. DAG size of input: 40 DAG size of output 22
[2018-02-02 10:58:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:58:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 133 proven. 384 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked.
[2018-02-02 10:58:34,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:58:34,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2018-02-02 10:58:34,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:58:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked.
[2018-02-02 10:58:34,851 INFO L182 omatonBuilderFactory]: Interpolants [16964#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 16965#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 16966#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 16967#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 16968#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 16969#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 16970#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 16971#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 16972#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 16749#true, 16973#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 16750#false, 16974#(and (< 8 |#Ultimate.C_memset_#amount|) (<= (* 3 |#Ultimate.C_memset_#t~loopctr48|) (+ (div (+ (- 25769803749) (* 4294967293 |#Ultimate.C_memset_#amount|)) 4294967296) 4294967320))), 16975#(and (< 8 |#Ultimate.C_memset_#amount|) (<= (* 4294967296 |#Ultimate.C_memset_#amount|) (+ (* 4294967293 |#Ultimate.C_memset_#t~loopctr48|) (div (+ (- 25769803749) (* 4294967293 |#Ultimate.C_memset_#amount|)) 4294967296) 4294967320))), 16948#(not (= 12 |zalloc_or_die_#in~size|)), 16949#(and (= (mod (* (mod |calloc_model_#in~size| 4294967296) (mod calloc_model_~nmemb 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 16890#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16891#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16925#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16926#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12))))]
[2018-02-02 10:58:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 133 proven. 384 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked.
[2018-02-02 10:58:34,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 10:58:34,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 10:58:34,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=338, Unknown=2, NotChecked=0, Total=380
[2018-02-02 10:58:34,852 INFO L87 Difference]: Start difference. First operand 282 states and 307 transitions. Second operand 20 states.
[2018-02-02 10:58:38,547 WARN L143 SmtUtils]: Spent 318ms on a formula simplification that was a NOOP. DAG size: 21
Received shutdown request...
[2018-02-02 10:58:56,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-02-02 10:58:56,495 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-02-02 10:58:56,500 WARN L185 ceAbstractionStarter]: Timeout
[2018-02-02 10:58:56,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:58:56 BoogieIcfgContainer
[2018-02-02 10:58:56,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 10:58:56,500 INFO L168 Benchmark]: Toolchain (without parser) took 71650.75 ms. Allocated memory was 404.2 MB in the beginning and 959.4 MB in the end (delta: 555.2 MB). Free memory was 360.9 MB in the beginning and 800.4 MB in the end (delta: -439.5 MB). Peak memory consumption was 115.7 MB. Max. memory is 5.3 GB.
[2018-02-02 10:58:56,501 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 10:58:56,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.09 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 348.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB.
[2018-02-02 10:58:56,502 INFO L168 Benchmark]: Boogie Preprocessor took 35.85 ms. Allocated memory is still 404.2 MB. Free memory was 347.6 MB in the beginning and 346.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-02 10:58:56,502 INFO L168 Benchmark]: RCFGBuilder took 458.76 ms. Allocated memory is still 404.2 MB. Free memory was 346.2 MB in the beginning and 289.2 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB.
[2018-02-02 10:58:56,502 INFO L168 Benchmark]: TraceAbstraction took 70977.17 ms. Allocated memory was 404.2 MB in the beginning and 959.4 MB in the end (delta: 555.2 MB). Free memory was 289.2 MB in the beginning and 800.4 MB in the end (delta: -511.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 5.3 GB.
[2018-02-02 10:58:56,504 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.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 176.09 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 348.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 35.85 ms. Allocated memory is still 404.2 MB. Free memory was 347.6 MB in the beginning and 346.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 458.76 ms. Allocated memory is still 404.2 MB. Free memory was 346.2 MB in the beginning and 289.2 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 70977.17 ms. Allocated memory was 404.2 MB in the beginning and 959.4 MB in the end (delta: 555.2 MB). Free memory was 289.2 MB in the beginning and 800.4 MB in the end (delta: -511.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 874]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 874). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (282states) and interpolant automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (289 states constructedinput type IntersectNwa).
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 16 procedures, 250 locations, 83 error locations. TIMEOUT Result, 70.9s OverallTime, 23 OverallIterations, 44 TraceHistogramMax, 58.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5279 SDtfs, 3534 SDslu, 32296 SDs, 0 SdLazy, 33589 SolverSat, 1243 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 49.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 933 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 524 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2014 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 5730/7484 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 1033 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1988 NumberOfCodeBlocks, 1988 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1965 ConstructedInterpolants, 8 QuantifiedInterpolants, 866176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 5730/7484 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/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-58-56-513.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-58-56-513.csv
Completed graceful shutdown