java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 20:34:26,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 20:34:26,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 20:34:26,304 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 20:34:26,304 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 20:34:26,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 20:34:26,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 20:34:26,308 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 20:34:26,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 20:34:26,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 20:34:26,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 20:34:26,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 20:34:26,312 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 20:34:26,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 20:34:26,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 20:34:26,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 20:34:26,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 20:34:26,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 20:34:26,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 20:34:26,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 20:34:26,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 20:34:26,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 20:34:26,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 20:34:26,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 20:34:26,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 20:34:26,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 20:34:26,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 20:34:26,326 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 20:34:26,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 20:34:26,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 20:34:26,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 20:34:26,327 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-04 20:34:26,338 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 20:34:26,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 20:34:26,339 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 20:34:26,339 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 20:34:26,339 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 20:34:26,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 20:34:26,340 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 20:34:26,340 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 20:34:26,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 20:34:26,340 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 20:34:26,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 20:34:26,340 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 20:34:26,341 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 20:34:26,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 20:34:26,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 20:34:26,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 20:34:26,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 20:34:26,341 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 20:34:26,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 20:34:26,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 20:34:26,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 20:34:26,342 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 20:34:26,342 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 20:34:26,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:34:26,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 20:34:26,380 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 20:34:26,383 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 20:34:26,384 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 20:34:26,384 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 20:34:26,385 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-04 20:34:26,537 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 20:34:26,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 20:34:26,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 20:34:26,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 20:34:26,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 20:34:26,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:34:26" (1/1) ... [2018-02-04 20:34:26,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26, skipping insertion in model container [2018-02-04 20:34:26,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:34:26" (1/1) ... [2018-02-04 20:34:26,562 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:34:26,594 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:34:26,690 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:34:26,707 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:34:26,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26 WrapperNode [2018-02-04 20:34:26,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 20:34:26,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 20:34:26,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 20:34:26,717 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 20:34:26,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26" (1/1) ... [2018-02-04 20:34:26,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26" (1/1) ... [2018-02-04 20:34:26,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26" (1/1) ... [2018-02-04 20:34:26,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26" (1/1) ... [2018-02-04 20:34:26,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26" (1/1) ... [2018-02-04 20:34:26,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26" (1/1) ... [2018-02-04 20:34:26,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26" (1/1) ... [2018-02-04 20:34:26,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 20:34:26,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 20:34:26,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 20:34:26,750 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 20:34:26,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 20:34:26,784 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 20:34:26,784 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 20:34:26,785 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 20:34:26,786 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 20:34:26,786 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 20:34:26,786 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 20:34:26,787 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 20:34:26,787 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 20:34:26,787 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 20:34:26,787 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 20:34:26,787 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 20:34:26,787 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 20:34:26,787 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 20:34:26,787 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 20:34:26,787 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 20:34:26,787 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 20:34:26,788 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 20:34:26,788 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 20:34:26,788 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 20:34:26,788 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 20:34:27,040 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 20:34:27,241 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 20:34:27,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:34:27 BoogieIcfgContainer [2018-02-04 20:34:27,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 20:34:27,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 20:34:27,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 20:34:27,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 20:34:27,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 08:34:26" (1/3) ... [2018-02-04 20:34:27,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6259f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:34:27, skipping insertion in model container [2018-02-04 20:34:27,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:34:26" (2/3) ... [2018-02-04 20:34:27,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6259f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:34:27, skipping insertion in model container [2018-02-04 20:34:27,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:34:27" (3/3) ... [2018-02-04 20:34:27,246 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0237_true-valid-memsafety.i [2018-02-04 20:34:27,252 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 20:34:27,259 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-02-04 20:34:27,281 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 20:34:27,281 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 20:34:27,281 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 20:34:27,281 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 20:34:27,281 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 20:34:27,281 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 20:34:27,281 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 20:34:27,281 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 20:34:27,282 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 20:34:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2018-02-04 20:34:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 20:34:27,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:27,300 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 20:34:27,300 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-04 20:34:27,303 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-04 20:34:27,316 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:27,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:34:27,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:34:27,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:27,368 INFO L182 omatonBuilderFactory]: Interpolants [253#true, 254#false, 255#(= 1 (select |#valid| |~#list~0.base|))] [2018-02-04 20:34:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:27,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 20:34:27,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 20:34:27,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 20:34:27,378 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 3 states. [2018-02-04 20:34:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:27,610 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions. [2018-02-04 20:34:27,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 20:34:27,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 20:34:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:27,623 INFO L225 Difference]: With dead ends: 279 [2018-02-04 20:34:27,623 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 20:34:27,624 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-04 20:34:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 20:34:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 245. [2018-02-04 20:34:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-04 20:34:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions. [2018-02-04 20:34:27,725 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 4 [2018-02-04 20:34:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:27,725 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions. [2018-02-04 20:34:27,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 20:34:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions. [2018-02-04 20:34:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 20:34:27,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:27,726 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 20:34:27,726 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-04 20:34:27,727 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-04 20:34:27,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:27,739 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:34:27,743 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:27,743 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:27,744 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:27,744 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:27,769 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-04 20:34:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:27,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:34:27,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:34:27,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:27,805 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-04 20:34:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:27,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 20:34:27,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 20:34:27,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 20:34:27,807 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 4 states. [2018-02-04 20:34:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:27,939 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2018-02-04 20:34:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 20:34:27,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 20:34:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:27,941 INFO L225 Difference]: With dead ends: 252 [2018-02-04 20:34:27,941 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 20:34:27,942 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-04 20:34:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 20:34:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 244. [2018-02-04 20:34:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 20:34:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions. [2018-02-04 20:34:27,954 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 4 [2018-02-04 20:34:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:27,954 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions. [2018-02-04 20:34:27,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 20:34:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions. [2018-02-04 20:34:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 20:34:27,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:27,955 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:34:27,955 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-04 20:34:27,955 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-04 20:34:27,958 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:27,975 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:34:27,976 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:27,976 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:27,977 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:27,977 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:27,983 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-04 20:34:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:28,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:34:28,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 20:34:28,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:28,045 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-04 20:34:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:28,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 20:34:28,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 20:34:28,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-02-04 20:34:28,046 INFO L87 Difference]: Start difference. First operand 244 states and 259 transitions. Second operand 6 states. [2018-02-04 20:34:28,075 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-04 20:34:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:28,677 INFO L93 Difference]: Finished difference Result 275 states and 296 transitions. [2018-02-04 20:34:28,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 20:34:28,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 20:34:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:28,680 INFO L225 Difference]: With dead ends: 275 [2018-02-04 20:34:28,681 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 20:34:28,681 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-04 20:34:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 20:34:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 243. [2018-02-04 20:34:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 20:34:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-02-04 20:34:28,692 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 17 [2018-02-04 20:34:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:28,693 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-02-04 20:34:28,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 20:34:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-02-04 20:34:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 20:34:28,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:28,693 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:34:28,693 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-04 20:34:28,694 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:34:28,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:28,716 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 20:34:28,761 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:28,762 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:28,762 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:28,762 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:28,785 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:28,785 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:28,787 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:28,787 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:28,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:34:28,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 20:34:28,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:28,926 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-04 20:34:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:28,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:34:28,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:34:28,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=56, Unknown=1, NotChecked=0, Total=72 [2018-02-04 20:34:28,927 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 9 states. [2018-02-04 20:34:28,985 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-04 20:34:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:29,621 INFO L93 Difference]: Finished difference Result 288 states and 310 transitions. [2018-02-04 20:34:29,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 20:34:29,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 20:34:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:29,624 INFO L225 Difference]: With dead ends: 288 [2018-02-04 20:34:29,624 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 20:34:29,625 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-04 20:34:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 20:34:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 256. [2018-02-04 20:34:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 20:34:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 271 transitions. [2018-02-04 20:34:29,633 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 271 transitions. Word has length 17 [2018-02-04 20:34:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:29,633 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 271 transitions. [2018-02-04 20:34:29,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:34:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 271 transitions. [2018-02-04 20:34:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 20:34:29,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:29,635 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-04 20:34:29,635 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-04 20:34:29,635 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-04 20:34:29,641 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:29,826 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-04 20:34:29,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:34:29,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 20:34:29,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:29,846 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-04 20:34:29,847 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-04 20:34:29,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:34:29,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:34:29,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:34:29,847 INFO L87 Difference]: Start difference. First operand 256 states and 271 transitions. Second operand 11 states. [2018-02-04 20:34:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:31,019 INFO L93 Difference]: Finished difference Result 316 states and 346 transitions. [2018-02-04 20:34:31,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 20:34:31,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-02-04 20:34:31,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:31,021 INFO L225 Difference]: With dead ends: 316 [2018-02-04 20:34:31,022 INFO L226 Difference]: Without dead ends: 309 [2018-02-04 20:34:31,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:34:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-04 20:34:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 259. [2018-02-04 20:34:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-04 20:34:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 275 transitions. [2018-02-04 20:34:31,031 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 275 transitions. Word has length 40 [2018-02-04 20:34:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:31,031 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 275 transitions. [2018-02-04 20:34:31,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:34:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 275 transitions. [2018-02-04 20:34:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 20:34:31,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:31,032 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-04 20:34:31,032 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-04 20:34:31,032 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-04 20:34:31,037 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:31,302 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-04 20:34:31,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:31,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:34:31,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:31,333 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-04 20:34:31,333 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-04 20:34:31,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:34:31,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:34:31,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:34:31,334 INFO L87 Difference]: Start difference. First operand 259 states and 275 transitions. Second operand 12 states. [2018-02-04 20:34:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:32,456 INFO L93 Difference]: Finished difference Result 322 states and 353 transitions. [2018-02-04 20:34:32,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:34:32,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-04 20:34:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:32,458 INFO L225 Difference]: With dead ends: 322 [2018-02-04 20:34:32,458 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 20:34:32,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:34:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 20:34:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 260. [2018-02-04 20:34:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-04 20:34:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 277 transitions. [2018-02-04 20:34:32,467 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 277 transitions. Word has length 41 [2018-02-04 20:34:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:32,467 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 277 transitions. [2018-02-04 20:34:32,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:34:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 277 transitions. [2018-02-04 20:34:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 20:34:32,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:32,468 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:34:32,468 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-04 20:34:32,469 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-04 20:34:32,472 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:32,674 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-04 20:34:32,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:32,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:34:32,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:32,693 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-04 20:34:32,693 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-04 20:34:32,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:34:32,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:34:32,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:34:32,694 INFO L87 Difference]: Start difference. First operand 260 states and 277 transitions. Second operand 13 states. [2018-02-04 20:34:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:33,815 INFO L93 Difference]: Finished difference Result 325 states and 357 transitions. [2018-02-04 20:34:33,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 20:34:33,815 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-02-04 20:34:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:33,816 INFO L225 Difference]: With dead ends: 325 [2018-02-04 20:34:33,816 INFO L226 Difference]: Without dead ends: 318 [2018-02-04 20:34:33,817 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-04 20:34:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-04 20:34:33,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 261. [2018-02-04 20:34:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-04 20:34:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 279 transitions. [2018-02-04 20:34:33,824 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 279 transitions. Word has length 42 [2018-02-04 20:34:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:33,825 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 279 transitions. [2018-02-04 20:34:33,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:34:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 279 transitions. [2018-02-04 20:34:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 20:34:33,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:33,826 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-04 20:34:33,826 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-04 20:34:33,826 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-04 20:34:33,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:33,995 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-04 20:34:34,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:34,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:34:34,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:34,011 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-04 20:34:34,011 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-04 20:34:34,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:34:34,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:34:34,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:34:34,012 INFO L87 Difference]: Start difference. First operand 261 states and 279 transitions. Second operand 14 states. [2018-02-04 20:34:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:35,019 INFO L93 Difference]: Finished difference Result 328 states and 361 transitions. [2018-02-04 20:34:35,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 20:34:35,020 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-02-04 20:34:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:35,021 INFO L225 Difference]: With dead ends: 328 [2018-02-04 20:34:35,022 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 20:34:35,022 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-04 20:34:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 20:34:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262. [2018-02-04 20:34:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-02-04 20:34:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 281 transitions. [2018-02-04 20:34:35,028 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 281 transitions. Word has length 43 [2018-02-04 20:34:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:35,028 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 281 transitions. [2018-02-04 20:34:35,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:34:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 281 transitions. [2018-02-04 20:34:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 20:34:35,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:35,029 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-04 20:34:35,029 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-04 20:34:35,029 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-04 20:34:35,042 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:35,262 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-04 20:34:35,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:35,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:34:35,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:35,279 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-04 20:34:35,280 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-04 20:34:35,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:34:35,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:34:35,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:34:35,280 INFO L87 Difference]: Start difference. First operand 262 states and 281 transitions. Second operand 15 states. [2018-02-04 20:34:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:36,286 INFO L93 Difference]: Finished difference Result 331 states and 365 transitions. [2018-02-04 20:34:36,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 20:34:36,286 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-04 20:34:36,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:36,287 INFO L225 Difference]: With dead ends: 331 [2018-02-04 20:34:36,287 INFO L226 Difference]: Without dead ends: 324 [2018-02-04 20:34:36,288 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-04 20:34:36,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-04 20:34:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 263. [2018-02-04 20:34:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 20:34:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 283 transitions. [2018-02-04 20:34:36,296 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 283 transitions. Word has length 44 [2018-02-04 20:34:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:36,296 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 283 transitions. [2018-02-04 20:34:36,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:34:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 283 transitions. [2018-02-04 20:34:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 20:34:36,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:36,297 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-04 20:34:36,297 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-04 20:34:36,297 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-04 20:34:36,305 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:36,494 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-04 20:34:36,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:36,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:34:36,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:36,512 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-04 20:34:36,512 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-04 20:34:36,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:34:36,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:34:36,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:34:36,513 INFO L87 Difference]: Start difference. First operand 263 states and 283 transitions. Second operand 16 states. [2018-02-04 20:34:37,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:37,697 INFO L93 Difference]: Finished difference Result 334 states and 369 transitions. [2018-02-04 20:34:37,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 20:34:37,697 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-02-04 20:34:37,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:37,699 INFO L225 Difference]: With dead ends: 334 [2018-02-04 20:34:37,699 INFO L226 Difference]: Without dead ends: 327 [2018-02-04 20:34:37,699 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-04 20:34:37,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-04 20:34:37,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 264. [2018-02-04 20:34:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 20:34:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 285 transitions. [2018-02-04 20:34:37,706 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 285 transitions. Word has length 45 [2018-02-04 20:34:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:37,706 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 285 transitions. [2018-02-04 20:34:37,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:34:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 285 transitions. [2018-02-04 20:34:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 20:34:37,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:37,707 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-04 20:34:37,707 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-04 20:34:37,708 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-04 20:34:37,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:37,945 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-04 20:34:37,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:37,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:34:37,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:37,962 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-04 20:34:37,962 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-04 20:34:37,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:34:37,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:34:37,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:34:37,963 INFO L87 Difference]: Start difference. First operand 264 states and 285 transitions. Second operand 17 states. [2018-02-04 20:34:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:39,202 INFO L93 Difference]: Finished difference Result 337 states and 373 transitions. [2018-02-04 20:34:39,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 20:34:39,203 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-02-04 20:34:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:39,204 INFO L225 Difference]: With dead ends: 337 [2018-02-04 20:34:39,204 INFO L226 Difference]: Without dead ends: 330 [2018-02-04 20:34:39,204 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-04 20:34:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-04 20:34:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 265. [2018-02-04 20:34:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 20:34:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 287 transitions. [2018-02-04 20:34:39,211 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 287 transitions. Word has length 46 [2018-02-04 20:34:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:39,211 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 287 transitions. [2018-02-04 20:34:39,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:34:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 287 transitions. [2018-02-04 20:34:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 20:34:39,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:39,212 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-04 20:34:39,212 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-04 20:34:39,212 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-04 20:34:39,224 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:39,453 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-04 20:34:39,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:39,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:34:39,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:39,471 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-04 20:34:39,471 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-04 20:34:39,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:34:39,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:34:39,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:34:39,472 INFO L87 Difference]: Start difference. First operand 265 states and 287 transitions. Second operand 18 states. [2018-02-04 20:34:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:40,747 INFO L93 Difference]: Finished difference Result 340 states and 377 transitions. [2018-02-04 20:34:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 20:34:40,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-02-04 20:34:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:40,748 INFO L225 Difference]: With dead ends: 340 [2018-02-04 20:34:40,748 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 20:34:40,748 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-04 20:34:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 20:34:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 266. [2018-02-04 20:34:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 20:34:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 289 transitions. [2018-02-04 20:34:40,753 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 289 transitions. Word has length 47 [2018-02-04 20:34:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:40,753 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 289 transitions. [2018-02-04 20:34:40,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:34:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 289 transitions. [2018-02-04 20:34:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 20:34:40,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:40,754 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-04 20:34:40,754 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-04 20:34:40,755 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-04 20:34:40,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:40,778 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-04 20:34:40,784 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:40,784 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:40,785 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:40,785 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:40,790 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:40,791 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:40,791 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:40,791 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:34:40,793 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 20:34:40,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 20:34:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:40,903 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-04 20:34:40,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:40,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 20:34:40,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:34:40,920 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-04 20:34:40,921 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-04 20:34:40,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:34:40,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:34:40,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=86, Unknown=2, NotChecked=0, Total=110 [2018-02-04 20:34:40,921 INFO L87 Difference]: Start difference. First operand 266 states and 289 transitions. Second operand 11 states. [2018-02-04 20:34:41,033 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)|)) is different from false [2018-02-04 20:34:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:41,639 INFO L93 Difference]: Finished difference Result 317 states and 347 transitions. [2018-02-04 20:34:41,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 20:34:41,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 20:34:41,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:41,642 INFO L225 Difference]: With dead ends: 317 [2018-02-04 20:34:41,642 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 20:34:41,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=4, NotChecked=26, Total=240 [2018-02-04 20:34:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 20:34:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 279. [2018-02-04 20:34:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-04 20:34:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 303 transitions. [2018-02-04 20:34:41,646 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 303 transitions. Word has length 48 [2018-02-04 20:34:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:41,647 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 303 transitions. [2018-02-04 20:34:41,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:34:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 303 transitions. [2018-02-04 20:34:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 20:34:41,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:41,648 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-04 20:34:41,648 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-04 20:34:41,648 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-04 20:34:41,650 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:41,916 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-04 20:34:41,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:34:41,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 20:34:41,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:41,935 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-04 20:34:41,935 INFO L182 omatonBuilderFactory]: Interpolants [8545#true, 8737#(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)))), 8546#false, 8757#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 8758#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 8759#(<= |#Ultimate.C_memset_#amount| 0), 8650#(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)|)), 8651#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8685#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8750#(not (= 12 |zalloc_or_die_#in~size|)), 8751#(= (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-04 20:34:41,935 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-04 20:34:41,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:34:41,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:34:41,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:34:41,936 INFO L87 Difference]: Start difference. First operand 279 states and 303 transitions. Second operand 11 states. [2018-02-04 20:34:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:42,787 INFO L93 Difference]: Finished difference Result 324 states and 353 transitions. [2018-02-04 20:34:42,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 20:34:42,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 137 [2018-02-04 20:34:42,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:42,788 INFO L225 Difference]: With dead ends: 324 [2018-02-04 20:34:42,788 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 20:34:42,789 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-04 20:34:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 20:34:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 281. [2018-02-04 20:34:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 20:34:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 20:34:42,794 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 137 [2018-02-04 20:34:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:42,795 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 20:34:42,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:34:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 20:34:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 20:34:42,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:42,797 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-04 20:34:42,797 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-04 20:34:42,797 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-04 20:34:42,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:42,995 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-04 20:34:43,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:43,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:34:43,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:43,013 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-04 20:34:43,013 INFO L182 omatonBuilderFactory]: Interpolants [9553#(or (not (= |calloc_model_#in~size| 12)) (not (= |calloc_model_#in~nmemb| 1))), 9554#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 9555#(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|))), 9556#(<= |#Ultimate.C_memset_#amount| 1), 9495#(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)|)), 9496#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9545#(not (= 12 |zalloc_or_die_#in~size|)), 9386#true, 9530#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9546#(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)))), 9387#false, 9531#(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-04 20:34:43,013 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-04 20:34:43,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:34:43,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:34:43,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:34:43,014 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 12 states. [2018-02-04 20:34:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:44,762 INFO L93 Difference]: Finished difference Result 326 states and 355 transitions. [2018-02-04 20:34:44,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 20:34:44,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2018-02-04 20:34:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:44,764 INFO L225 Difference]: With dead ends: 326 [2018-02-04 20:34:44,764 INFO L226 Difference]: Without dead ends: 319 [2018-02-04 20:34:44,764 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-04 20:34:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-04 20:34:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 281. [2018-02-04 20:34:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 20:34:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 20:34:44,768 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 141 [2018-02-04 20:34:44,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:44,769 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 20:34:44,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:34:44,769 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 20:34:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 20:34:44,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:44,770 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-04 20:34:44,770 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-04 20:34:44,770 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-04 20:34:44,781 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:45,002 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-04 20:34:45,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:45,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:34:45,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:45,020 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-04 20:34:45,020 INFO L182 omatonBuilderFactory]: Interpolants [10250#true, 10251#false, 10414#(not (= 12 |zalloc_or_die_#in~size|)), 10415#(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)))), 10423#(or (not (= |calloc_model_#in~size| 12)) (not (= |calloc_model_#in~nmemb| 1))), 10424#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 10425#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 10426#(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))), 10363#(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)|)), 10427#(<= |#Ultimate.C_memset_#amount| 2), 10364#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10398#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10399#(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-04 20:34:45,020 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-04 20:34:45,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:34:45,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:34:45,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:34:45,021 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 13 states. [2018-02-04 20:34:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:45,868 INFO L93 Difference]: Finished difference Result 328 states and 357 transitions. [2018-02-04 20:34:45,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 20:34:45,868 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 145 [2018-02-04 20:34:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:45,869 INFO L225 Difference]: With dead ends: 328 [2018-02-04 20:34:45,869 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 20:34:45,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2018-02-04 20:34:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 20:34:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 281. [2018-02-04 20:34:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 20:34:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 20:34:45,872 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 145 [2018-02-04 20:34:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:45,873 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 20:34:45,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:34:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 20:34:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 20:34:45,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:45,873 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-04 20:34:45,873 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-04 20:34:45,874 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-04 20:34:45,876 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,202 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 20:34:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:46,312 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-04 20:34:46,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:46,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:34:46,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:46,332 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-04 20:34:46,332 INFO L182 omatonBuilderFactory]: Interpolants [11300#(not (= 12 |zalloc_or_die_#in~size|)), 11301#(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)))), 11310#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 11311#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 11248#(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)|)), 11312#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 11249#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11313#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 11314#(and (< 2 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 11283#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11315#(and (< 2 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3)), 11284#(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)))), 11131#true, 11132#false] [2018-02-04 20:34:46,332 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-04 20:34:46,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:34:46,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:34:46,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:34:46,332 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 14 states. [2018-02-04 20:34:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:47,743 INFO L93 Difference]: Finished difference Result 333 states and 362 transitions. [2018-02-04 20:34:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:34:47,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2018-02-04 20:34:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:47,744 INFO L225 Difference]: With dead ends: 333 [2018-02-04 20:34:47,745 INFO L226 Difference]: Without dead ends: 326 [2018-02-04 20:34:47,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:34:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-04 20:34:47,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 281. [2018-02-04 20:34:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 20:34:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 20:34:47,751 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 149 [2018-02-04 20:34:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:47,751 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 20:34:47,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:34:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 20:34:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 20:34:47,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:47,752 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-04 20:34:47,752 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-04 20:34:47,752 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:34:47,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:48,051 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-04 20:34:48,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:48,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:34:48,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:48,071 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-04 20:34:48,071 INFO L182 omatonBuilderFactory]: Interpolants [12194#(not (= 12 |zalloc_or_die_#in~size|)), 12195#(= (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)), 12141#(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)|)), 12205#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 12142#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12206#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 12207#(<= |#Ultimate.C_memset_#t~loopctr48| 1), 12176#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12208#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 12177#(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)))), 12209#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 12210#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 12211#(not (= 12 |#Ultimate.C_memset_#amount|)), 12020#true, 12021#false] [2018-02-04 20:34:48,071 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-04 20:34:48,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:34:48,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:34:48,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:34:48,071 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 15 states. [2018-02-04 20:34:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:34:49,161 INFO L93 Difference]: Finished difference Result 335 states and 364 transitions. [2018-02-04 20:34:49,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 20:34:49,162 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153 [2018-02-04 20:34:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:34:49,163 INFO L225 Difference]: With dead ends: 335 [2018-02-04 20:34:49,163 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 20:34:49,163 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-04 20:34:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 20:34:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 281. [2018-02-04 20:34:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 20:34:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 20:34:49,166 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 153 [2018-02-04 20:34:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:34:49,167 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 20:34:49,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:34:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 20:34:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 20:34:49,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:34:49,169 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-04 20:34:49,169 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-04 20:34:49,169 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-04 20:34:49,171 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:34:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:49,529 WARN L146 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 20:34:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:34:51,875 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-04 20:34:51,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:34:51,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:34:51,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:34:51,891 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-04 20:34:51,892 INFO L182 omatonBuilderFactory]: Interpolants [13059#(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)|)), 13060#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13125#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 12934#true, 13094#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13126#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 12935#false, 13095#(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)))), 13127#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 13128#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|)), 13129#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3) (< 1 |#Ultimate.C_memset_#amount|)), 13130#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 13131#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 13132#(and (< 1 |#Ultimate.C_memset_#amount|) (<= 0 (+ (div (+ (- 17179869149) (* (- 7) |#Ultimate.C_memset_#amount|)) 4294967296) 5))), 13113#(not (= 12 |zalloc_or_die_#in~size|)), 13114#(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-04 20:34:51,892 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-04 20:34:51,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:34:51,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:34:51,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2018-02-04 20:34:51,892 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 16 states. [2018-02-04 20:35:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:03,721 INFO L93 Difference]: Finished difference Result 337 states and 366 transitions. [2018-02-04 20:35:03,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 20:35:03,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 157 [2018-02-04 20:35:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:03,722 INFO L225 Difference]: With dead ends: 337 [2018-02-04 20:35:03,722 INFO L226 Difference]: Without dead ends: 330 [2018-02-04 20:35:03,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=111, Invalid=699, Unknown=2, NotChecked=0, Total=812 [2018-02-04 20:35:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-04 20:35:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 281. [2018-02-04 20:35:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 20:35:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 20:35:03,726 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 157 [2018-02-04 20:35:03,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:03,726 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 20:35:03,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:35:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 20:35:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-04 20:35:03,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:03,727 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-04 20:35:03,727 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-04 20:35:03,727 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-04 20:35:03,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:04,088 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-04 20:35:04,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:35:04,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:35:04,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:04,106 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-04 20:35:04,106 INFO L182 omatonBuilderFactory]: Interpolants [13859#true, 13860#false, 13988#(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)|)), 13989#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14023#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14024#(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)))), 14056#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 14057#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 14058#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 14059#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 14060#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 14061#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 14062#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 14063#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 14064#(not (= |#Ultimate.C_memset_#amount| 12)), 14043#(not (= 12 |zalloc_or_die_#in~size|)), 14044#(= (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-04 20:35:04,107 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-04 20:35:04,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:35:04,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:35:04,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:35:04,107 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 17 states. [2018-02-04 20:35:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:05,356 INFO L93 Difference]: Finished difference Result 339 states and 368 transitions. [2018-02-04 20:35:05,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 20:35:05,357 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 161 [2018-02-04 20:35:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:05,358 INFO L225 Difference]: With dead ends: 339 [2018-02-04 20:35:05,358 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 20:35:05,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 20:35:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 20:35:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 281. [2018-02-04 20:35:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 20:35:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 20:35:05,361 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 161 [2018-02-04 20:35:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:05,362 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 20:35:05,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:35:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 20:35:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-04 20:35:05,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:05,362 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-04 20:35:05,362 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-04 20:35:05,363 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-04 20:35:05,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,727 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 20:35:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:05,970 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-04 20:35:05,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:35:05,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:35:05,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:05,988 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-04 20:35:05,988 INFO L182 omatonBuilderFactory]: Interpolants [14976#(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)))), 15010#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 15011#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 15012#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 15013#(and (= |#Ultimate.C_memset_#t~loopctr48| 2) (< 1 |#Ultimate.C_memset_#amount|)), 15014#(and (<= |#Ultimate.C_memset_#t~loopctr48| 3) (< 1 |#Ultimate.C_memset_#amount|)), 15015#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 15016#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 15017#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (< 1 |#Ultimate.C_memset_#amount|)), 15018#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 15019#(and (<= |#Ultimate.C_memset_#amount| 7) (< 1 |#Ultimate.C_memset_#amount|)), 14996#(not (= 12 |zalloc_or_die_#in~size|)), 14997#(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)))), 14807#true, 14808#false, 14940#(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)|)), 14941#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14975#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:35:05,988 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-04 20:35:05,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:35:05,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:35:05,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:35:05,989 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 18 states. [2018-02-04 20:35:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:07,626 INFO L93 Difference]: Finished difference Result 339 states and 367 transitions. [2018-02-04 20:35:07,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:35:07,626 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 165 [2018-02-04 20:35:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:07,627 INFO L225 Difference]: With dead ends: 339 [2018-02-04 20:35:07,628 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 20:35:07,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 20:35:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 20:35:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 279. [2018-02-04 20:35:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-04 20:35:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 302 transitions. [2018-02-04 20:35:07,632 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 302 transitions. Word has length 165 [2018-02-04 20:35:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:07,632 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 302 transitions. [2018-02-04 20:35:07,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:35:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 302 transitions. [2018-02-04 20:35:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 20:35:07,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:07,633 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-04 20:35:07,633 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-04 20:35:07,633 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-04 20:35:07,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:07,950 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-04 20:35:07,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:35:07,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 20:35:07,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:07,967 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-04 20:35:07,967 INFO L182 omatonBuilderFactory]: Interpolants [15971#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 15972#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 15973#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 15974#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 15975#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 15976#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 15977#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 15978#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 15979#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 15980#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 15981#(not (= 12 |#Ultimate.C_memset_#amount|)), 15762#true, 15763#false, 15956#(not (= 12 |zalloc_or_die_#in~size|)), 15957#(= (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)), 15899#(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)|)), 15900#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15934#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15935#(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-04 20:35:07,967 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-04 20:35:07,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 20:35:07,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 20:35:07,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-02-04 20:35:07,968 INFO L87 Difference]: Start difference. First operand 279 states and 302 transitions. Second operand 19 states. [2018-02-04 20:35:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:09,172 INFO L93 Difference]: Finished difference Result 345 states and 375 transitions. [2018-02-04 20:35:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 20:35:09,173 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 169 [2018-02-04 20:35:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:09,174 INFO L225 Difference]: With dead ends: 345 [2018-02-04 20:35:09,174 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 20:35:09,174 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-04 20:35:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 20:35:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 282. [2018-02-04 20:35:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-04 20:35:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 307 transitions. [2018-02-04 20:35:09,179 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 307 transitions. Word has length 169 [2018-02-04 20:35:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:09,180 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 307 transitions. [2018-02-04 20:35:09,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 20:35:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 307 transitions. [2018-02-04 20:35:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-04 20:35:09,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:09,181 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-04 20:35:09,181 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-04 20:35:09,181 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-04 20:35:09,185 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:09,556 WARN L146 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 20:35:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:12,398 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-04 20:35:12,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:35:12,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 20:35:12,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:12,416 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-04 20:35:12,416 INFO L182 omatonBuilderFactory]: Interpolants [16962#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 16963#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 16964#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 16965#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 16966#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 16967#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 16968#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 16969#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 16970#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 16747#true, 16971#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 16748#false, 16972#(and (< 8 |#Ultimate.C_memset_#amount|) (<= (* 3 |#Ultimate.C_memset_#t~loopctr48|) (+ (div (+ (- 25769803749) (* 4294967293 |#Ultimate.C_memset_#amount|)) 4294967296) 4294967320))), 16973#(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))), 16946#(not (= 12 |zalloc_or_die_#in~size|)), 16947#(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)))), 16888#(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)|)), 16889#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16923#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16924#(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-04 20:35:12,416 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-04 20:35:12,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 20:35:12,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 20:35:12,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=339, Unknown=1, NotChecked=0, Total=380 [2018-02-04 20:35:12,417 INFO L87 Difference]: Start difference. First operand 282 states and 307 transitions. Second operand 20 states. [2018-02-04 20:35:18,844 WARN L143 SmtUtils]: Spent 3455ms on a formula simplification that was a NOOP. DAG size: 21 [2018-02-04 20:35:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:47,689 INFO L93 Difference]: Finished difference Result 348 states and 380 transitions. [2018-02-04 20:35:47,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 20:35:47,689 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 173 [2018-02-04 20:35:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:47,690 INFO L225 Difference]: With dead ends: 348 [2018-02-04 20:35:47,691 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 20:35:47,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=98, Invalid=769, Unknown=3, NotChecked=0, Total=870 [2018-02-04 20:35:47,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 20:35:47,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 283. [2018-02-04 20:35:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 20:35:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 309 transitions. [2018-02-04 20:35:47,696 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 309 transitions. Word has length 173 [2018-02-04 20:35:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:47,696 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 309 transitions. [2018-02-04 20:35:47,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 20:35:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 309 transitions. [2018-02-04 20:35:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 20:35:47,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:47,698 INFO L351 BasicCegarLoop]: trace histogram [48, 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-04 20:35:47,698 INFO L371 AbstractCegarLoop]: === Iteration 24 === [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-04 20:35:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1363596610, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:35:47,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 142 proven. 457 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2018-02-04 20:35:47,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:35:47,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 20:35:47,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-02-04 20:35:47,970 INFO L182 omatonBuilderFactory]: Interpolants [17952#(or (not (= |calloc_model_#in~size| 12)) (not (= |calloc_model_#in~nmemb| 1))), 17953#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 17954#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 17731#true, 17955#(= |#Ultimate.C_memset_#t~loopctr48| 2), 17732#false, 17956#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 17957#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 17958#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 17959#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 17960#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 17961#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 17962#(<= |#Ultimate.C_memset_#t~loopctr48| 9), 17963#(<= |#Ultimate.C_memset_#t~loopctr48| 10), 17964#(not (= 12 |#Ultimate.C_memset_#amount|)), 17935#(not (= 12 |zalloc_or_die_#in~size|)), 17936#(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)))), 17876#(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)|)), 17877#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17911#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17912#(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-04 20:35:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 142 proven. 457 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2018-02-04 20:35:47,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 20:35:47,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 20:35:47,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:35:47,971 INFO L87 Difference]: Start difference. First operand 283 states and 309 transitions. Second operand 21 states. [2018-02-04 20:35:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:49,139 INFO L93 Difference]: Finished difference Result 345 states and 379 transitions. [2018-02-04 20:35:49,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 20:35:49,140 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 177 [2018-02-04 20:35:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:49,141 INFO L225 Difference]: With dead ends: 345 [2018-02-04 20:35:49,141 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 20:35:49,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=333, Invalid=1559, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 20:35:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 20:35:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 284. [2018-02-04 20:35:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:35:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 311 transitions. [2018-02-04 20:35:49,144 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 311 transitions. Word has length 177 [2018-02-04 20:35:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:49,144 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 311 transitions. [2018-02-04 20:35:49,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 20:35:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 311 transitions. [2018-02-04 20:35:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-04 20:35:49,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:49,145 INFO L351 BasicCegarLoop]: trace histogram [52, 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-04 20:35:49,145 INFO L371 AbstractCegarLoop]: === Iteration 25 === [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-04 20:35:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1442599558, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:35:49,159 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 151 proven. 537 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2018-02-04 20:35:49,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:35:49,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 20:35:49,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-02-04 20:35:49,447 INFO L182 omatonBuilderFactory]: Interpolants [18752#true, 18753#false, 18979#(or (not (= |calloc_model_#in~size| 12)) (not (= |calloc_model_#in~nmemb| 1))), 18980#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 18981#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 18982#(= |#Ultimate.C_memset_#t~loopctr48| 2), 18983#(= |#Ultimate.C_memset_#t~loopctr48| 3), 18984#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 18985#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 18986#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 18987#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 18988#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 18989#(<= |#Ultimate.C_memset_#t~loopctr48| 9), 18990#(<= |#Ultimate.C_memset_#t~loopctr48| 10), 18991#(<= |#Ultimate.C_memset_#t~loopctr48| 11), 18992#(not (= 12 |#Ultimate.C_memset_#amount|)), 18961#(not (= 12 |zalloc_or_die_#in~size|)), 18962#(and (= |calloc_model_#in~size| calloc_model_~size) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 18901#(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)|)), 18902#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18936#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18937#(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-04 20:35:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 151 proven. 537 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2018-02-04 20:35:49,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 20:35:49,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 20:35:49,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2018-02-04 20:35:49,448 INFO L87 Difference]: Start difference. First operand 284 states and 311 transitions. Second operand 22 states. [2018-02-04 20:35:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:52,738 INFO L93 Difference]: Finished difference Result 348 states and 384 transitions. [2018-02-04 20:35:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 20:35:52,738 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 181 [2018-02-04 20:35:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:52,739 INFO L225 Difference]: With dead ends: 348 [2018-02-04 20:35:52,739 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 20:35:52,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=363, Invalid=1707, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 20:35:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 20:35:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 285. [2018-02-04 20:35:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 20:35:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 313 transitions. [2018-02-04 20:35:52,743 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 313 transitions. Word has length 181 [2018-02-04 20:35:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:52,743 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 313 transitions. [2018-02-04 20:35:52,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 20:35:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 313 transitions. [2018-02-04 20:35:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 20:35:52,744 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:52,744 INFO L351 BasicCegarLoop]: trace histogram [56, 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-04 20:35:52,744 INFO L371 AbstractCegarLoop]: === Iteration 26 === [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-04 20:35:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash 393937982, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:35:52,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:52,816 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-04 20:35:52,830 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:35:52,830 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:35:52,830 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:35:52,830 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:35:52,836 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:35:52,836 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:35:52,836 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:35:52,836 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:35:52,839 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 20:35:52,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 20:35:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2018-02-04 20:35:53,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:35:53,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 20:35:53,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-02-04 20:35:53,139 INFO L182 omatonBuilderFactory]: Interpolants [19792#true, 19952#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19793#false, 19986#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19945#(= |zalloc_or_die_#in~size| 119), 19946#(= 119 zalloc_or_die_~size), 19947#(exists ((%0 (Array Int Int))) (! (and (= |calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 119) (store |#length| %1 119)) :qid itp)) (= |calloc_model_#in~size| 119)) :qid itp)), 19948#(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))) 119) (forall ((%1 Int)) (! (= (store %0 %1 119) (store |#length| %1 119)) :qid itp))) :qid itp)), 19949#(and (= 119 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (= 119 (select |#length| |calloc_model_#t~malloc0.base|)) (= 0 |calloc_model_#t~malloc0.offset|)), 19950#(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)))), 19951#(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-04 20:35:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2018-02-04 20:35:53,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:35:53,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:35:53,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=86, Unknown=2, NotChecked=0, Total=110 [2018-02-04 20:35:53,141 INFO L87 Difference]: Start difference. First operand 285 states and 313 transitions. Second operand 11 states. [2018-02-04 20:35:53,292 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 119) (store |c_#length| %1 119)) :qid itp)) (= |c_calloc_model_#in~size| 119)) :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)|)) is different from false [2018-02-04 20:35:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:53,815 INFO L93 Difference]: Finished difference Result 315 states and 348 transitions. [2018-02-04 20:35:53,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 20:35:53,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2018-02-04 20:35:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:53,816 INFO L225 Difference]: With dead ends: 315 [2018-02-04 20:35:53,816 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 20:35:53,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=4, NotChecked=26, Total=240 [2018-02-04 20:35:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 20:35:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 284. [2018-02-04 20:35:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:35:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 312 transitions. [2018-02-04 20:35:53,819 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 312 transitions. Word has length 185 [2018-02-04 20:35:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:53,820 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 312 transitions. [2018-02-04 20:35:53,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:35:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 312 transitions. [2018-02-04 20:35:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-04 20:35:53,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:53,821 INFO L351 BasicCegarLoop]: trace histogram [56, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:35:53,821 INFO L371 AbstractCegarLoop]: === Iteration 27 === [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-04 20:35:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1717176598, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:35:53,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:35:54,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:35:54,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 20:35:54,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:35:54,084 INFO L182 omatonBuilderFactory]: Interpolants [21152#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 21153#(<= |#Ultimate.C_memset_#amount| 0), 20931#(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)|)), 20932#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20966#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20760#true, 21144#(not (= 119 |zalloc_or_die_#in~size|)), 20761#false, 21145#(and (= |calloc_model_#in~size| calloc_model_~size) (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))), 21131#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 21151#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119)))] [2018-02-04 20:35:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:35:54,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:35:54,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:35:54,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:35:54,085 INFO L87 Difference]: Start difference. First operand 284 states and 312 transitions. Second operand 11 states. [2018-02-04 20:35:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:54,826 INFO L93 Difference]: Finished difference Result 322 states and 354 transitions. [2018-02-04 20:35:54,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:35:54,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 198 [2018-02-04 20:35:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:54,827 INFO L225 Difference]: With dead ends: 322 [2018-02-04 20:35:54,827 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 20:35:54,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:35:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 20:35:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 20:35:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:35:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 311 transitions. [2018-02-04 20:35:54,831 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 311 transitions. Word has length 198 [2018-02-04 20:35:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:54,831 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 311 transitions. [2018-02-04 20:35:54,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:35:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 311 transitions. [2018-02-04 20:35:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-02-04 20:35:54,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:54,832 INFO L351 BasicCegarLoop]: trace histogram [57, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:35:54,832 INFO L371 AbstractCegarLoop]: === Iteration 28 === [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-04 20:35:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1442176407, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:35:54,835 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:55,216 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 20:35:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 187 proven. 1 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:35:55,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:35:55,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:35:55,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:35:55,281 INFO L182 omatonBuilderFactory]: Interpolants [22180#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 22181#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 21958#(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)|)), 22182#(and (<= |#Ultimate.C_memset_#t~loopctr48| 1) (< 0 |#Ultimate.C_memset_#amount|)), 21959#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22183#(and (<= |#Ultimate.C_memset_#amount| 1) (< 0 |#Ultimate.C_memset_#amount|)), 21993#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21786#true, 21787#false, 22172#(not (= |zalloc_or_die_#in~size| 119)), 22173#(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)))), 22158#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119)))] [2018-02-04 20:35:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 187 proven. 1 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:35:55,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:35:55,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:35:55,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:35:55,282 INFO L87 Difference]: Start difference. First operand 284 states and 311 transitions. Second operand 12 states. [2018-02-04 20:35:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:56,622 INFO L93 Difference]: Finished difference Result 322 states and 353 transitions. [2018-02-04 20:35:56,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 20:35:56,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 199 [2018-02-04 20:35:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:56,624 INFO L225 Difference]: With dead ends: 322 [2018-02-04 20:35:56,624 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 20:35:56,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:35:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 20:35:56,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 20:35:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:35:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 310 transitions. [2018-02-04 20:35:56,627 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 310 transitions. Word has length 199 [2018-02-04 20:35:56,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:56,627 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 310 transitions. [2018-02-04 20:35:56,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:35:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 310 transitions. [2018-02-04 20:35:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-02-04 20:35:56,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:56,628 INFO L351 BasicCegarLoop]: trace histogram [58, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:35:56,628 INFO L371 AbstractCegarLoop]: === Iteration 29 === [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-04 20:35:56,629 INFO L82 PathProgramCache]: Analyzing trace with hash -597871754, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:35:56,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 248 proven. 3 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:35:56,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:35:56,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:35:56,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:35:56,981 INFO L182 omatonBuilderFactory]: Interpolants [22981#(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)|)), 23205#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 22982#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23206#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 23207#(and (= 1 |#Ultimate.C_memset_#t~loopctr48|) (< 0 |#Ultimate.C_memset_#amount|)), 23016#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23208#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (< 1 |#Ultimate.C_memset_#amount|)), 23209#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 2)), 23181#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 22808#true, 22809#false, 23196#(not (= |zalloc_or_die_#in~size| 119)), 23197#(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-04 20:35:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 248 proven. 3 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:35:56,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:35:56,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:35:56,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:35:56,983 INFO L87 Difference]: Start difference. First operand 284 states and 310 transitions. Second operand 13 states. [2018-02-04 20:35:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:35:58,516 INFO L93 Difference]: Finished difference Result 322 states and 352 transitions. [2018-02-04 20:35:58,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 20:35:58,517 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 200 [2018-02-04 20:35:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:35:58,517 INFO L225 Difference]: With dead ends: 322 [2018-02-04 20:35:58,518 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 20:35:58,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-02-04 20:35:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 20:35:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 20:35:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:35:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 309 transitions. [2018-02-04 20:35:58,520 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 309 transitions. Word has length 200 [2018-02-04 20:35:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:35:58,520 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 309 transitions. [2018-02-04 20:35:58,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:35:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 309 transitions. [2018-02-04 20:35:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 20:35:58,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:35:58,521 INFO L351 BasicCegarLoop]: trace histogram [59, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:35:58,521 INFO L371 AbstractCegarLoop]: === Iteration 30 === [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-04 20:35:58,521 INFO L82 PathProgramCache]: Analyzing trace with hash -194231287, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:35:58,548 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:35:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:35:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 309 proven. 6 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:35:58,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:35:58,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:35:58,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:35:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:35:58,831 INFO L182 omatonBuilderFactory]: Interpolants [24224#(not (= |zalloc_or_die_#in~size| 119)), 24225#(and (= |calloc_model_#in~size| calloc_model_~size) (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))), 24008#(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)|)), 24009#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24234#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 24043#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24235#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 24236#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 24237#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 24238#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 24239#(<= |#Ultimate.C_memset_#amount| 3), 24208#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 23834#true, 23835#false] [2018-02-04 20:35:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 309 proven. 6 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:35:58,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:35:58,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:35:58,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:35:58,832 INFO L87 Difference]: Start difference. First operand 284 states and 309 transitions. Second operand 14 states. [2018-02-04 20:36:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:36:00,842 INFO L93 Difference]: Finished difference Result 322 states and 351 transitions. [2018-02-04 20:36:00,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 20:36:00,842 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 201 [2018-02-04 20:36:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:36:00,843 INFO L225 Difference]: With dead ends: 322 [2018-02-04 20:36:00,843 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 20:36:00,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:36:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 20:36:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 20:36:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:36:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 308 transitions. [2018-02-04 20:36:00,847 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 308 transitions. Word has length 201 [2018-02-04 20:36:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:36:00,847 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 308 transitions. [2018-02-04 20:36:00,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:36:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 308 transitions. [2018-02-04 20:36:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 20:36:00,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:36:00,849 INFO L351 BasicCegarLoop]: trace histogram [60, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:36:00,849 INFO L371 AbstractCegarLoop]: === Iteration 31 === [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-04 20:36:00,849 INFO L82 PathProgramCache]: Analyzing trace with hash -566278698, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:36:00,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:36:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 370 proven. 10 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:01,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:36:01,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:36:01,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:36:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:36:01,109 INFO L182 omatonBuilderFactory]: Interpolants [24870#true, 24871#false, 25262#(not (= |zalloc_or_die_#in~size| 119)), 25263#(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)))), 25045#(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)|)), 25046#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25080#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25273#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 25274#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 25275#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 25276#(= |#Ultimate.C_memset_#t~loopctr48| 2), 25245#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 25277#(= |#Ultimate.C_memset_#t~loopctr48| 3), 25278#(or (and (<= |#Ultimate.C_memset_#amount| 4) (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr48|)) (and (< 4 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr48| |#Ultimate.C_memset_#amount|))), 25279#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-04 20:36:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 370 proven. 10 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:01,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:36:01,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:36:01,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:36:01,110 INFO L87 Difference]: Start difference. First operand 284 states and 308 transitions. Second operand 15 states. [2018-02-04 20:36:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:36:02,039 INFO L93 Difference]: Finished difference Result 322 states and 350 transitions. [2018-02-04 20:36:02,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 20:36:02,040 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 202 [2018-02-04 20:36:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:36:02,041 INFO L225 Difference]: With dead ends: 322 [2018-02-04 20:36:02,041 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 20:36:02,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-02-04 20:36:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 20:36:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 20:36:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:36:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 307 transitions. [2018-02-04 20:36:02,047 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 307 transitions. Word has length 202 [2018-02-04 20:36:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:36:02,047 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 307 transitions. [2018-02-04 20:36:02,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:36:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 307 transitions. [2018-02-04 20:36:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-02-04 20:36:02,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:36:02,049 INFO L351 BasicCegarLoop]: trace histogram [61, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:36:02,049 INFO L371 AbstractCegarLoop]: === Iteration 32 === [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-04 20:36:02,049 INFO L82 PathProgramCache]: Analyzing trace with hash 785153449, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:36:02,054 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:36:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 431 proven. 15 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:02,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:36:02,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:36:02,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:36:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:36:02,338 INFO L182 omatonBuilderFactory]: Interpolants [26304#(not (= |zalloc_or_die_#in~size| 119)), 26305#(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)))), 26086#(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)|)), 26087#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26121#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26316#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 26317#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 26286#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 26318#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 26319#(= |#Ultimate.C_memset_#t~loopctr48| 2), 26320#(= |#Ultimate.C_memset_#t~loopctr48| 3), 26321#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 26322#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 26323#(not (= |#Ultimate.C_memset_#amount| 119)), 25910#true, 25911#false] [2018-02-04 20:36:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 431 proven. 15 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:02,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:36:02,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:36:02,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:36:02,338 INFO L87 Difference]: Start difference. First operand 284 states and 307 transitions. Second operand 16 states. [2018-02-04 20:36:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:36:03,355 INFO L93 Difference]: Finished difference Result 322 states and 349 transitions. [2018-02-04 20:36:03,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 20:36:03,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 203 [2018-02-04 20:36:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:36:03,356 INFO L225 Difference]: With dead ends: 322 [2018-02-04 20:36:03,356 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 20:36:03,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-02-04 20:36:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 20:36:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 20:36:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:36:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 306 transitions. [2018-02-04 20:36:03,361 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 306 transitions. Word has length 203 [2018-02-04 20:36:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:36:03,361 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 306 transitions. [2018-02-04 20:36:03,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:36:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 306 transitions. [2018-02-04 20:36:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-02-04 20:36:03,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:36:03,362 INFO L351 BasicCegarLoop]: trace histogram [62, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:36:03,363 INFO L371 AbstractCegarLoop]: === Iteration 33 === [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-04 20:36:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash -270122954, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:36:03,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:36:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2533 backedges. 492 proven. 21 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:03,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:36:03,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:36:03,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:36:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:36:03,731 INFO L182 omatonBuilderFactory]: Interpolants [27331#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 27363#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 27364#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 27365#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 27366#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 27367#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 27368#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 27369#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 26954#true, 27370#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (< 5 |#Ultimate.C_memset_#amount|)), 26955#false, 27371#(and (<= |#Ultimate.C_memset_#amount| 6) (< 5 |#Ultimate.C_memset_#amount|)), 27350#(not (= |zalloc_or_die_#in~size| 119)), 27351#(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)))), 27131#(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)|)), 27132#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27166#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:36:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2533 backedges. 492 proven. 21 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:03,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:36:03,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:36:03,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:36:03,732 INFO L87 Difference]: Start difference. First operand 284 states and 306 transitions. Second operand 17 states. [2018-02-04 20:36:05,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:36:05,327 INFO L93 Difference]: Finished difference Result 322 states and 348 transitions. [2018-02-04 20:36:05,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 20:36:05,327 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 204 [2018-02-04 20:36:05,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:36:05,329 INFO L225 Difference]: With dead ends: 322 [2018-02-04 20:36:05,329 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 20:36:05,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:36:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 20:36:05,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 20:36:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:36:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 305 transitions. [2018-02-04 20:36:05,333 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 305 transitions. Word has length 204 [2018-02-04 20:36:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:36:05,334 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 305 transitions. [2018-02-04 20:36:05,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:36:05,334 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 305 transitions. [2018-02-04 20:36:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-02-04 20:36:05,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:36:05,335 INFO L351 BasicCegarLoop]: trace histogram [63, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:36:05,335 INFO L371 AbstractCegarLoop]: === Iteration 34 === [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-04 20:36:05,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1376046921, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:36:05,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:36:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 553 proven. 28 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:05,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:36:05,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:36:05,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:36:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:36:05,723 INFO L182 omatonBuilderFactory]: Interpolants [28416#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 28417#(not (= |#Ultimate.C_memset_#amount| 119)), 28394#(not (= |zalloc_or_die_#in~size| 119)), 28395#(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)))), 28174#(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)|)), 28175#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28209#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28374#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 28408#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 28409#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 28410#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 28411#(= |#Ultimate.C_memset_#t~loopctr48| 2), 27996#true, 28412#(= |#Ultimate.C_memset_#t~loopctr48| 3), 27997#false, 28413#(= 4 |#Ultimate.C_memset_#t~loopctr48|), 28414#(= |#Ultimate.C_memset_#t~loopctr48| 5), 28415#(<= |#Ultimate.C_memset_#t~loopctr48| 6)] [2018-02-04 20:36:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 553 proven. 28 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:05,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:36:05,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:36:05,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:36:05,723 INFO L87 Difference]: Start difference. First operand 284 states and 305 transitions. Second operand 18 states. [2018-02-04 20:36:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:36:06,451 INFO L93 Difference]: Finished difference Result 320 states and 345 transitions. [2018-02-04 20:36:06,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 20:36:06,452 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 205 [2018-02-04 20:36:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:36:06,453 INFO L225 Difference]: With dead ends: 320 [2018-02-04 20:36:06,453 INFO L226 Difference]: Without dead ends: 311 [2018-02-04 20:36:06,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2018-02-04 20:36:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-04 20:36:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 282. [2018-02-04 20:36:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-04 20:36:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 302 transitions. [2018-02-04 20:36:06,456 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 302 transitions. Word has length 205 [2018-02-04 20:36:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:36:06,457 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 302 transitions. [2018-02-04 20:36:06,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:36:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 302 transitions. [2018-02-04 20:36:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-04 20:36:06,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:36:06,458 INFO L351 BasicCegarLoop]: trace histogram [64, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:36:06,458 INFO L371 AbstractCegarLoop]: === Iteration 35 === [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-04 20:36:06,458 INFO L82 PathProgramCache]: Analyzing trace with hash 867705494, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:36:06,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:36:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:07,139 WARN L146 SmtUtils]: Spent 484ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 20:36:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:12,265 WARN L1033 $PredicateComparison]: unable to prove that (and (< 7 |c_#Ultimate.C_memset_#amount|) (<= (* 4294967296 |c_#Ultimate.C_memset_#amount|) (+ (* 4294967185 |c_#Ultimate.C_memset_#t~loopctr48|) (div (+ (- 21474835592) (* 4294967185 |c_#Ultimate.C_memset_#amount|)) 4294967296) 4294968073))) is different from true [2018-02-04 20:36:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 614 proven. 35 refuted. 1 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:12,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:36:12,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 20:36:12,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:36:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:36:12,315 INFO L182 omatonBuilderFactory]: Interpolants [29444#(not (= |zalloc_or_die_#in~size| 119)), 29445#(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)))), 29223#(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)|)), 29224#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29258#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29423#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 29459#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 29044#true, 29460#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 29045#false, 29461#(and (<= |#Ultimate.C_memset_#t~loopctr48| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr48|)), 29462#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 29463#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 29464#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 29465#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 29466#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 29467#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 29468#(and (< 7 |#Ultimate.C_memset_#amount|) (<= (* 111 |#Ultimate.C_memset_#t~loopctr48|) (+ (div (+ (- 21474835592) (* 4294967185 |#Ultimate.C_memset_#amount|)) 4294967296) 4294968073))), 29469#(and (< 7 |#Ultimate.C_memset_#amount|) (<= (* 4294967296 |#Ultimate.C_memset_#amount|) (+ (* 4294967185 |#Ultimate.C_memset_#t~loopctr48|) (div (+ (- 21474835592) (* 4294967185 |#Ultimate.C_memset_#amount|)) 4294967296) 4294968073)))] [2018-02-04 20:36:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 614 proven. 35 refuted. 1 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:12,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 20:36:12,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 20:36:12,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=270, Unknown=2, NotChecked=32, Total=342 [2018-02-04 20:36:12,315 INFO L87 Difference]: Start difference. First operand 282 states and 302 transitions. Second operand 19 states. [2018-02-04 20:36:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:36:58,336 INFO L93 Difference]: Finished difference Result 323 states and 348 transitions. [2018-02-04 20:36:58,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 20:36:58,337 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2018-02-04 20:36:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:36:58,338 INFO L225 Difference]: With dead ends: 323 [2018-02-04 20:36:58,338 INFO L226 Difference]: Without dead ends: 316 [2018-02-04 20:36:58,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=88, Invalid=616, Unknown=2, NotChecked=50, Total=756 [2018-02-04 20:36:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-04 20:36:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 284. [2018-02-04 20:36:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:36:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 304 transitions. [2018-02-04 20:36:58,341 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 304 transitions. Word has length 206 [2018-02-04 20:36:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:36:58,341 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 304 transitions. [2018-02-04 20:36:58,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 20:36:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 304 transitions. [2018-02-04 20:36:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 20:36:58,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:36:58,342 INFO L351 BasicCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:36:58,342 INFO L371 AbstractCegarLoop]: === Iteration 36 === [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-04 20:36:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2005976855, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:36:58,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:36:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:36:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2740 backedges. 675 proven. 45 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:58,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:36:58,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 20:36:58,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:36:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:36:58,645 INFO L182 omatonBuilderFactory]: Interpolants [30497#(not (= |zalloc_or_die_#in~size| 119)), 30498#(and (= |calloc_model_#in~size| calloc_model_~size) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 30275#(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)|)), 30276#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30310#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30475#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 30095#true, 30096#false, 30513#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 30514#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 30515#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 30516#(= |#Ultimate.C_memset_#t~loopctr48| 2), 30517#(= |#Ultimate.C_memset_#t~loopctr48| 3), 30518#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 30519#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 30520#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 30521#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 30522#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 30523#(<= |#Ultimate.C_memset_#t~loopctr48| 9), 30524#(not (= |#Ultimate.C_memset_#amount| 119))] [2018-02-04 20:36:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2740 backedges. 675 proven. 45 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:36:58,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 20:36:58,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 20:36:58,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-04 20:36:58,646 INFO L87 Difference]: Start difference. First operand 284 states and 304 transitions. Second operand 20 states. [2018-02-04 20:37:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:37:01,900 INFO L93 Difference]: Finished difference Result 322 states and 347 transitions. [2018-02-04 20:37:01,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:37:01,900 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-02-04 20:37:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:37:01,901 INFO L225 Difference]: With dead ends: 322 [2018-02-04 20:37:01,901 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 20:37:01,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 20:37:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 20:37:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 284. [2018-02-04 20:37:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:37:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 304 transitions. [2018-02-04 20:37:01,906 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 304 transitions. Word has length 207 [2018-02-04 20:37:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:37:01,906 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 304 transitions. [2018-02-04 20:37:01,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 20:37:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 304 transitions. [2018-02-04 20:37:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-02-04 20:37:01,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:37:01,907 INFO L351 BasicCegarLoop]: trace histogram [66, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:37:01,907 INFO L371 AbstractCegarLoop]: === Iteration 37 === [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-04 20:37:01,907 INFO L82 PathProgramCache]: Analyzing trace with hash -895816458, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:37:01,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:37:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2811 backedges. 736 proven. 55 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:02,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:37:02,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 20:37:02,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:37:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:37:02,349 INFO L182 omatonBuilderFactory]: Interpolants [31584#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 31585#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 31586#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 31587#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 31588#(<= |#Ultimate.C_memset_#t~loopctr48| 9), 31589#(<= |#Ultimate.C_memset_#t~loopctr48| 10), 31590#(not (= |#Ultimate.C_memset_#amount| 119)), 31561#(not (= |zalloc_or_die_#in~size| 119)), 31338#(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)|)), 31562#(= (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)), 31339#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 31373#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 31538#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 31157#true, 31158#false, 31578#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 31579#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 31580#(= |#Ultimate.C_memset_#t~loopctr48| 1), 31581#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 31582#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 31583#(<= |#Ultimate.C_memset_#t~loopctr48| 4)] [2018-02-04 20:37:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2811 backedges. 736 proven. 55 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:02,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 20:37:02,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 20:37:02,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:37:02,350 INFO L87 Difference]: Start difference. First operand 284 states and 304 transitions. Second operand 21 states. [2018-02-04 20:37:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:37:03,348 INFO L93 Difference]: Finished difference Result 327 states and 352 transitions. [2018-02-04 20:37:03,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 20:37:03,348 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 208 [2018-02-04 20:37:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:37:03,349 INFO L225 Difference]: With dead ends: 327 [2018-02-04 20:37:03,349 INFO L226 Difference]: Without dead ends: 320 [2018-02-04 20:37:03,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:37:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-04 20:37:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 284. [2018-02-04 20:37:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 20:37:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 304 transitions. [2018-02-04 20:37:03,351 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 304 transitions. Word has length 208 [2018-02-04 20:37:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:37:03,352 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 304 transitions. [2018-02-04 20:37:03,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 20:37:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 304 transitions. [2018-02-04 20:37:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-04 20:37:03,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:37:03,353 INFO L351 BasicCegarLoop]: trace histogram [67, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:37:03,353 INFO L371 AbstractCegarLoop]: === Iteration 38 === [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-04 20:37:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash -840582519, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:37:03,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:37:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:04,204 WARN L146 SmtUtils]: Spent 651ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 20:37:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 797 proven. 66 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:04,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:37:04,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 20:37:04,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:37:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:37:04,492 INFO L182 omatonBuilderFactory]: Interpolants [32224#true, 32225#false, 32648#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 32649#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 32650#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 32651#(and (= |#Ultimate.C_memset_#t~loopctr48| 2) (< 1 |#Ultimate.C_memset_#amount|)), 32652#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3) (< 1 |#Ultimate.C_memset_#amount|)), 32653#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 32654#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 32655#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (< 1 |#Ultimate.C_memset_#amount|) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 32656#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 32657#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|)), 32658#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 32659#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 32660#(and (< 10 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 32661#(and (< 10 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 11)), 32406#(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)|)), 32630#(not (= |zalloc_or_die_#in~size| 119)), 32407#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32631#(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)))), 32441#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32606#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119)))] [2018-02-04 20:37:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 797 proven. 66 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:04,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 20:37:04,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 20:37:04,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-02-04 20:37:04,493 INFO L87 Difference]: Start difference. First operand 284 states and 304 transitions. Second operand 22 states. [2018-02-04 20:37:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:37:05,883 INFO L93 Difference]: Finished difference Result 327 states and 351 transitions. [2018-02-04 20:37:05,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 20:37:05,883 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 209 [2018-02-04 20:37:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:37:05,885 INFO L225 Difference]: With dead ends: 327 [2018-02-04 20:37:05,885 INFO L226 Difference]: Without dead ends: 320 [2018-02-04 20:37:05,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2018-02-04 20:37:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-04 20:37:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 282. [2018-02-04 20:37:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-04 20:37:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 301 transitions. [2018-02-04 20:37:05,889 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 301 transitions. Word has length 209 [2018-02-04 20:37:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:37:05,890 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 301 transitions. [2018-02-04 20:37:05,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 20:37:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 301 transitions. [2018-02-04 20:37:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-02-04 20:37:05,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:37:05,891 INFO L351 BasicCegarLoop]: trace histogram [68, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:37:05,891 INFO L371 AbstractCegarLoop]: === Iteration 39 === [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-04 20:37:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash 871669590, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:37:05,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:37:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2956 backedges. 858 proven. 78 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:06,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:37:06,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 20:37:06,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:37:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:37:06,418 INFO L182 omatonBuilderFactory]: Interpolants [33472#(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)|)), 33728#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 33473#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 33729#(and (< 11 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 33697#(not (= |zalloc_or_die_#in~size| 119)), 33698#(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)))), 33730#(and (< 11 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 12)), 33507#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 33672#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 33289#true, 33290#false, 33716#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 33717#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 33718#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 33719#(= 2 |#Ultimate.C_memset_#t~loopctr48|), 33720#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 33721#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 33722#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 33723#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 33724#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 33725#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 33726#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 33727#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10))] [2018-02-04 20:37:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2956 backedges. 858 proven. 78 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:06,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 20:37:06,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 20:37:06,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-02-04 20:37:06,419 INFO L87 Difference]: Start difference. First operand 282 states and 301 transitions. Second operand 23 states. [2018-02-04 20:37:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:37:07,846 INFO L93 Difference]: Finished difference Result 333 states and 359 transitions. [2018-02-04 20:37:07,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 20:37:07,846 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 210 [2018-02-04 20:37:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:37:07,847 INFO L225 Difference]: With dead ends: 333 [2018-02-04 20:37:07,847 INFO L226 Difference]: Without dead ends: 326 [2018-02-04 20:37:07,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:37:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-04 20:37:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 285. [2018-02-04 20:37:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 20:37:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 306 transitions. [2018-02-04 20:37:07,851 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 306 transitions. Word has length 210 [2018-02-04 20:37:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:37:07,851 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 306 transitions. [2018-02-04 20:37:07,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 20:37:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 306 transitions. [2018-02-04 20:37:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-02-04 20:37:07,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:37:07,852 INFO L351 BasicCegarLoop]: trace histogram [69, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:37:07,852 INFO L371 AbstractCegarLoop]: === Iteration 40 === [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-04 20:37:07,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1883089879, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:37:07,855 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:37:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:08,560 WARN L146 SmtUtils]: Spent 516ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 20:37:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 919 proven. 91 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:08,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:37:08,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 20:37:08,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:37:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:37:08,893 INFO L182 omatonBuilderFactory]: Interpolants [34368#false, 34797#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 34798#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 34799#(and (<= |#Ultimate.C_memset_#t~loopctr48| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr48|)), 34800#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 34801#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 34802#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 34803#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 34804#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 34805#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 34806#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 34551#(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)|)), 34807#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 34552#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 34808#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 34809#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 34777#(not (= |zalloc_or_die_#in~size| 119)), 34586#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 34778#(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)))), 34810#(and (<= 12 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 34811#(and (< 12 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 13)), 34812#(and (< 12 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 13)), 34367#true, 34751#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119)))] [2018-02-04 20:37:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 919 proven. 91 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:08,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 20:37:08,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 20:37:08,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:37:08,894 INFO L87 Difference]: Start difference. First operand 285 states and 306 transitions. Second operand 24 states. [2018-02-04 20:37:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:37:10,375 INFO L93 Difference]: Finished difference Result 336 states and 364 transitions. [2018-02-04 20:37:10,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:37:10,375 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 211 [2018-02-04 20:37:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:37:10,376 INFO L225 Difference]: With dead ends: 336 [2018-02-04 20:37:10,376 INFO L226 Difference]: Without dead ends: 329 [2018-02-04 20:37:10,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 20:37:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-04 20:37:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 286. [2018-02-04 20:37:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-04 20:37:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 308 transitions. [2018-02-04 20:37:10,379 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 308 transitions. Word has length 211 [2018-02-04 20:37:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:37:10,379 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 308 transitions. [2018-02-04 20:37:10,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 20:37:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 308 transitions. [2018-02-04 20:37:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 20:37:10,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:37:10,380 INFO L351 BasicCegarLoop]: trace histogram [70, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:37:10,380 INFO L371 AbstractCegarLoop]: === Iteration 41 === [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-04 20:37:10,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1381287498, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:37:10,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:37:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:10,886 WARN L146 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 20:37:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 980 proven. 105 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:11,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:37:11,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 20:37:11,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:37:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:37:11,292 INFO L182 omatonBuilderFactory]: Interpolants [35673#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 35865#(not (= |zalloc_or_die_#in~size| 119)), 35866#(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)))), 35886#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 35887#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 35888#(and (<= |#Ultimate.C_memset_#t~loopctr48| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr48|)), 35889#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 35890#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 35891#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 35892#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 35893#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 35638#(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)|)), 35894#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 35639#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 35895#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 35896#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 35897#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 35898#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 35899#(and (<= 12 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 35900#(and (<= |#Ultimate.C_memset_#t~loopctr48| 13) (<= 13 |#Ultimate.C_memset_#t~loopctr48|)), 35453#true, 35901#(and (<= |#Ultimate.C_memset_#t~loopctr48| 14) (< 13 |#Ultimate.C_memset_#amount|)), 35454#false, 35838#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 35902#(and (< 13 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 14))] [2018-02-04 20:37:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 980 proven. 105 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:11,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 20:37:11,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 20:37:11,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-02-04 20:37:11,293 INFO L87 Difference]: Start difference. First operand 286 states and 308 transitions. Second operand 25 states. [2018-02-04 20:37:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:37:12,796 INFO L93 Difference]: Finished difference Result 339 states and 369 transitions. [2018-02-04 20:37:12,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 20:37:12,796 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 212 [2018-02-04 20:37:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:37:12,797 INFO L225 Difference]: With dead ends: 339 [2018-02-04 20:37:12,797 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 20:37:12,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 20:37:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 20:37:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 287. [2018-02-04 20:37:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-02-04 20:37:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 310 transitions. [2018-02-04 20:37:12,800 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 310 transitions. Word has length 212 [2018-02-04 20:37:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:37:12,800 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 310 transitions. [2018-02-04 20:37:12,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 20:37:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 310 transitions. [2018-02-04 20:37:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-04 20:37:12,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:37:12,801 INFO L351 BasicCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:37:12,801 INFO L371 AbstractCegarLoop]: === Iteration 42 === [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-04 20:37:12,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1289684425, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:37:12,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:37:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:13,207 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 20:37:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:37:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3181 backedges. 1041 proven. 120 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:22,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:37:22,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 20:37:22,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:37:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 20:37:22,144 INFO L182 omatonBuilderFactory]: Interpolants [36992#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 36993#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 36994#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 36547#true, 36995#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 36548#false, 36996#(and (<= 12 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 36933#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 36997#(and (<= |#Ultimate.C_memset_#t~loopctr48| 13) (<= 13 |#Ultimate.C_memset_#t~loopctr48|)), 36998#(and (<= 14 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 14)), 36999#(and (<= (* 13 |#Ultimate.C_memset_#t~loopctr48|) (+ (div (+ (- 6442450749) (* 536870899 |#Ultimate.C_memset_#amount|)) 536870912) 536871094)) (< 14 |#Ultimate.C_memset_#amount|)), 37000#(and (<= (* 536870912 |#Ultimate.C_memset_#amount|) (+ (* 536870899 |#Ultimate.C_memset_#t~loopctr48|) (div (+ (- 6442450749) (* 536870899 |#Ultimate.C_memset_#amount|)) 536870912) 536871094)) (< 14 |#Ultimate.C_memset_#amount|)), 36768#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 36961#(not (= |zalloc_or_die_#in~size| 119)), 36962#(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)))), 36983#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 36984#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 36985#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 36986#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 36987#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 36988#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 36733#(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)|)), 36989#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 36734#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 36990#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 36991#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7))] [2018-02-04 20:37:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3181 backedges. 1041 proven. 120 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 20:37:22,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 20:37:22,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 20:37:22,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=594, Unknown=4, NotChecked=0, Total=650 [2018-02-04 20:37:22,144 INFO L87 Difference]: Start difference. First operand 287 states and 310 transitions. Second operand 26 states. [2018-02-04 20:37:39,256 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (div (+ (- 6442450749) (* 536870899 |c_#Ultimate.C_memset_#amount|)) 536870912))) (and (<= (* 13 |c_#Ultimate.C_memset_#t~loopctr48|) (+ .cse0 536871094)) (<= (* 536870912 |c_#Ultimate.C_memset_#amount|) (+ (* 536870899 |c_#Ultimate.C_memset_#t~loopctr48|) .cse0 536871094)) (< 14 |c_#Ultimate.C_memset_#amount|))) is different from true Received shutdown request... [2018-02-04 20:37:58,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 20:37:58,585 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 20:37:58,590 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 20:37:58,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 08:37:58 BoogieIcfgContainer [2018-02-04 20:37:58,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 20:37:58,590 INFO L168 Benchmark]: Toolchain (without parser) took 212052.56 ms. Allocated memory was 402.7 MB in the beginning and 884.5 MB in the end (delta: 481.8 MB). Free memory was 359.5 MB in the beginning and 829.6 MB in the end (delta: -470.0 MB). Peak memory consumption was 11.8 MB. Max. memory is 5.3 GB. [2018-02-04 20:37:58,591 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 20:37:58,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.46 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 347.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-04 20:37:58,591 INFO L168 Benchmark]: Boogie Preprocessor took 32.86 ms. Allocated memory is still 402.7 MB. Free memory was 346.2 MB in the beginning and 344.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 20:37:58,592 INFO L168 Benchmark]: RCFGBuilder took 491.77 ms. Allocated memory is still 402.7 MB. Free memory was 344.9 MB in the beginning and 287.8 MB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 5.3 GB. [2018-02-04 20:37:58,592 INFO L168 Benchmark]: TraceAbstraction took 211347.65 ms. Allocated memory was 402.7 MB in the beginning and 884.5 MB in the end (delta: 481.8 MB). Free memory was 287.8 MB in the beginning and 829.6 MB in the end (delta: -541.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 20:37:58,593 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.46 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 347.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.86 ms. Allocated memory is still 402.7 MB. Free memory was 346.2 MB in the beginning and 344.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 491.77 ms. Allocated memory is still 402.7 MB. Free memory was 344.9 MB in the beginning and 287.8 MB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 211347.65 ms. Allocated memory was 402.7 MB in the beginning and 884.5 MB in the end (delta: 481.8 MB). Free memory was 287.8 MB in the beginning and 829.6 MB in the end (delta: -541.7 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 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 (287states) and interpolant automaton (currently 31 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 250 locations, 83 error locations. TIMEOUT Result, 211.3s OverallTime, 42 OverallIterations, 71 TraceHistogramMax, 176.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9498 SDtfs, 6197 SDslu, 70777 SDs, 0 SdLazy, 74886 SolverSat, 2147 SolverUnsat, 61 SolverUnknown, 0 SolverNotchecked, 145.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2140 GetRequests, 1087 SyntacticMatches, 0 SemanticMatches, 1053 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3838 ImplicationChecksByTransitivity, 49.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 51786/55224 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, 41 MinimizatonAttempts, 1730 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 31.6s InterpolantComputationTime, 5819 NumberOfCodeBlocks, 5819 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 5777 ConstructedInterpolants, 10 QuantifiedInterpolants, 3115760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 7 PerfectInterpolantSequences, 51786/55224 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-04_20-37-58-599.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-04_20-37-58-599.csv Completed graceful shutdown