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-0235_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:27:39,227 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:27:39,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:27:39,238 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:27:39,238 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:27:39,239 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:27:39,240 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:27:39,241 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:27:39,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:27:39,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:27:39,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:27:39,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:27:39,244 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:27:39,245 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:27:39,246 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:27:39,248 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:27:39,249 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:27:39,251 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:27:39,251 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:27:39,252 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:27:39,254 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:27:39,254 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:27:39,254 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:27:39,255 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:27:39,256 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:27:39,257 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:27:39,257 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:27:39,257 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:27:39,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:27:39,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:27:39,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:27:39,258 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 04:27:39,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:27:39,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:27:39,269 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:27:39,269 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:27:39,269 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:27:39,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:27:39,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:27:39,270 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:27:39,270 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:27:39,270 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:27:39,270 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:27:39,271 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:27:39,271 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:27:39,271 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:27:39,271 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:27:39,271 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:27:39,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:27:39,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:27:39,272 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:27:39,272 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:27:39,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:27:39,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:27:39,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 04:27:39,272 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 04:27:39,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:39,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:27:39,317 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:27:39,320 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:27:39,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:27:39,322 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:27:39,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i [2018-02-04 04:27:39,465 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:27:39,466 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:27:39,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:27:39,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:27:39,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:27:39,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:27:39" (1/1) ... [2018-02-04 04:27:39,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3390db28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39, skipping insertion in model container [2018-02-04 04:27:39,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:27:39" (1/1) ... [2018-02-04 04:27:39,490 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:27:39,523 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:27:39,650 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:27:39,672 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:27:39,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39 WrapperNode [2018-02-04 04:27:39,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:27:39,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:27:39,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:27:39,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:27:39,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39" (1/1) ... [2018-02-04 04:27:39,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39" (1/1) ... [2018-02-04 04:27:39,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39" (1/1) ... [2018-02-04 04:27:39,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39" (1/1) ... [2018-02-04 04:27:39,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39" (1/1) ... [2018-02-04 04:27:39,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39" (1/1) ... [2018-02-04 04:27:39,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39" (1/1) ... [2018-02-04 04:27:39,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:27:39,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:27:39,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:27:39,717 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:27:39,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39" (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 04:27:39,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 04:27:39,757 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 04:27:39,758 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 04:27:39,758 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 04:27:39,758 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 04:27:39,758 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 04:27:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 04:27:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:27:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 04:27:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 04:27:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 04:27:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 04:27:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 04:27:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 04:27:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 04:27:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 04:27:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 04:27:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 04:27:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 04:27:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:27:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:27:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:27:40,084 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 04:27:40,849 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:27:40,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:27:40 BoogieIcfgContainer [2018-02-04 04:27:40,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:27:40,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:27:40,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:27:40,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:27:40,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:27:39" (1/3) ... [2018-02-04 04:27:40,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0eab1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:27:40, skipping insertion in model container [2018-02-04 04:27:40,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:27:39" (2/3) ... [2018-02-04 04:27:40,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0eab1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:27:40, skipping insertion in model container [2018-02-04 04:27:40,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:27:40" (3/3) ... [2018-02-04 04:27:40,854 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_false-valid-deref.i [2018-02-04 04:27:40,859 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:27:40,864 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2018-02-04 04:27:40,885 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:27:40,886 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:27:40,886 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 04:27:40,886 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 04:27:40,886 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:27:40,886 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:27:40,886 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:27:40,886 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:27:40,886 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:27:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2018-02-04 04:27:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:27:40,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:40,908 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:27:40,908 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash 15319548, 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 04:27:40,920 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:40,956 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 04:27:40,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:27:40,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:27:40,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:40,975 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 04:27:40,975 INFO L182 omatonBuilderFactory]: Interpolants [278#true, 279#false, 280#(= 1 (select |#valid| |~#list~0.base|))] [2018-02-04 04:27:40,975 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 04:27:40,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:27:40,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:27:40,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:27:40,985 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 3 states. [2018-02-04 04:27:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:41,285 INFO L93 Difference]: Finished difference Result 394 states and 450 transitions. [2018-02-04 04:27:41,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:27:41,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 04:27:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:41,300 INFO L225 Difference]: With dead ends: 394 [2018-02-04 04:27:41,300 INFO L226 Difference]: Without dead ends: 391 [2018-02-04 04:27:41,302 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 04:27:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-04 04:27:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 345. [2018-02-04 04:27:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-04 04:27:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 426 transitions. [2018-02-04 04:27:41,433 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 426 transitions. Word has length 4 [2018-02-04 04:27:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:41,433 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 426 transitions. [2018-02-04 04:27:41,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:27:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 426 transitions. [2018-02-04 04:27:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:27:41,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:41,434 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:27:41,434 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:41,434 INFO L82 PathProgramCache]: Analyzing trace with hash 15319549, 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 04:27:41,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:41,451 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:27:41,459 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:41,459 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:41,460 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:41,460 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:41,492 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 04:27:41,593 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 04:27:41,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:27:41,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:27:41,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:41,621 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 04:27:41,621 INFO L182 omatonBuilderFactory]: Interpolants [1020#true, 1021#false, 1022#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 1023#(and (<= (+ |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (= 4 (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))] [2018-02-04 04:27:41,621 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 04:27:41,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:27:41,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:27:41,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:27:41,623 INFO L87 Difference]: Start difference. First operand 345 states and 426 transitions. Second operand 4 states. [2018-02-04 04:27:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:41,715 INFO L93 Difference]: Finished difference Result 352 states and 436 transitions. [2018-02-04 04:27:41,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:27:41,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 04:27:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:41,718 INFO L225 Difference]: With dead ends: 352 [2018-02-04 04:27:41,718 INFO L226 Difference]: Without dead ends: 352 [2018-02-04 04:27:41,718 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 04:27:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-02-04 04:27:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2018-02-04 04:27:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-04 04:27:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 425 transitions. [2018-02-04 04:27:41,736 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 425 transitions. Word has length 4 [2018-02-04 04:27:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:41,736 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 425 transitions. [2018-02-04 04:27:41,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:27:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 425 transitions. [2018-02-04 04:27:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:27:41,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:41,737 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 04:27:41,737 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:41,737 INFO L82 PathProgramCache]: Analyzing trace with hash 116258063, 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 04:27:41,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:41,765 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:27:41,768 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:41,768 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:41,768 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:41,768 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:41,774 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 04:27:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:41,810 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 04:27:41,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:27:41,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:27:41,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:41,843 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 04:27:41,843 INFO L182 omatonBuilderFactory]: Interpolants [1728#(= 1 (select |#valid| |calloc_model_#t~malloc0.base|)), 1729#(= 1 (select |#valid| calloc_model_~ptr~0.base)), 1730#(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)|)), 1720#true, 1721#false, 1727#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp))] [2018-02-04 04:27:41,843 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 04:27:41,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:27:41,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:27:41,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-02-04 04:27:41,844 INFO L87 Difference]: Start difference. First operand 344 states and 425 transitions. Second operand 6 states. [2018-02-04 04:27:41,883 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 04:27:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:42,552 INFO L93 Difference]: Finished difference Result 432 states and 529 transitions. [2018-02-04 04:27:42,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:27:42,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 04:27:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:42,555 INFO L225 Difference]: With dead ends: 432 [2018-02-04 04:27:42,555 INFO L226 Difference]: Without dead ends: 432 [2018-02-04 04:27:42,556 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 04:27:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-02-04 04:27:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 388. [2018-02-04 04:27:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-04 04:27:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 501 transitions. [2018-02-04 04:27:42,571 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 501 transitions. Word has length 17 [2018-02-04 04:27:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:42,571 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 501 transitions. [2018-02-04 04:27:42,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:27:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 501 transitions. [2018-02-04 04:27:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:27:42,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:42,572 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 04:27:42,573 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash 116258064, 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 04:27:42,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:42,598 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 04:27:42,616 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:42,617 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:42,617 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:42,617 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:42,626 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:42,626 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:42,626 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:42,627 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:42,729 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 04:27:42,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:27:42,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:27:42,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:42,758 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 04:27:42,758 INFO L182 omatonBuilderFactory]: Interpolants [2562#(= |zalloc_or_die_#in~size| 8), 2563#(= 8 zalloc_or_die_~size), 2564#(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)), 2565#(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)), 2566#(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|)), 2567#(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)))), 2568#(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)|)), 2555#true, 2556#false] [2018-02-04 04:27:42,758 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 04:27:42,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:27:42,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:27:42,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=56, Unknown=1, NotChecked=0, Total=72 [2018-02-04 04:27:42,759 INFO L87 Difference]: Start difference. First operand 388 states and 501 transitions. Second operand 9 states. [2018-02-04 04:27:42,818 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 04:27:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:43,698 INFO L93 Difference]: Finished difference Result 445 states and 543 transitions. [2018-02-04 04:27:43,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:27:43,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 04:27:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:43,700 INFO L225 Difference]: With dead ends: 445 [2018-02-04 04:27:43,701 INFO L226 Difference]: Without dead ends: 445 [2018-02-04 04:27:43,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=121, Unknown=3, NotChecked=22, Total=182 [2018-02-04 04:27:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-04 04:27:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 401. [2018-02-04 04:27:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-04 04:27:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 514 transitions. [2018-02-04 04:27:43,714 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 514 transitions. Word has length 17 [2018-02-04 04:27:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:43,714 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 514 transitions. [2018-02-04 04:27:43,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:27:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 514 transitions. [2018-02-04 04:27:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 04:27:43,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:43,718 INFO L351 BasicCegarLoop]: trace histogram [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 04:27:43,718 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:43,718 INFO L82 PathProgramCache]: Analyzing trace with hash 612491321, 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 04:27:43,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-04 04:27:44,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:27:44,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:27:44,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-04 04:27:44,042 INFO L182 omatonBuilderFactory]: Interpolants [3425#true, 3426#false, 3522#(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)|)), 3523#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3541#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3606#(not (= 8 |zalloc_or_die_#in~size|)), 3607#(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)))), 3593#(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))), 3613#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 8))), 3614#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 3615#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-04 04:27:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-04 04:27:44,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:27:44,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:27:44,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:27:44,043 INFO L87 Difference]: Start difference. First operand 401 states and 514 transitions. Second operand 11 states. [2018-02-04 04:27:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:45,187 INFO L93 Difference]: Finished difference Result 459 states and 556 transitions. [2018-02-04 04:27:45,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:27:45,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-02-04 04:27:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:45,189 INFO L225 Difference]: With dead ends: 459 [2018-02-04 04:27:45,189 INFO L226 Difference]: Without dead ends: 452 [2018-02-04 04:27:45,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:27:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-02-04 04:27:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 404. [2018-02-04 04:27:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-02-04 04:27:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 518 transitions. [2018-02-04 04:27:45,201 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 518 transitions. Word has length 129 [2018-02-04 04:27:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:45,201 INFO L432 AbstractCegarLoop]: Abstraction has 404 states and 518 transitions. [2018-02-04 04:27:45,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:27:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 518 transitions. [2018-02-04 04:27:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 04:27:45,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:45,203 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 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 04:27:45,203 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:45,203 INFO L82 PathProgramCache]: Analyzing trace with hash -750293478, 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 04:27:45,208 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-02-04 04:27:45,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:45,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:27:45,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-02-04 04:27:45,536 INFO L182 omatonBuilderFactory]: Interpolants [4626#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 4627#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4500#true, 4628#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 4501#false, 4629#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 1)) (and (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|))), 4630#(<= |#Ultimate.C_memset_#amount| 1), 4602#(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)|)), 4618#(not (= 8 |zalloc_or_die_#in~size|)), 4603#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4619#(= (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)), 4604#(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 04:27:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-02-04 04:27:45,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:27:45,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:27:45,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:27:45,537 INFO L87 Difference]: Start difference. First operand 404 states and 518 transitions. Second operand 12 states. [2018-02-04 04:27:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:46,531 INFO L93 Difference]: Finished difference Result 465 states and 563 transitions. [2018-02-04 04:27:46,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:27:46,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2018-02-04 04:27:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:46,533 INFO L225 Difference]: With dead ends: 465 [2018-02-04 04:27:46,533 INFO L226 Difference]: Without dead ends: 458 [2018-02-04 04:27:46,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:27:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-04 04:27:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 405. [2018-02-04 04:27:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-04 04:27:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 520 transitions. [2018-02-04 04:27:46,540 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 520 transitions. Word has length 134 [2018-02-04 04:27:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:46,541 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 520 transitions. [2018-02-04 04:27:46,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:27:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 520 transitions. [2018-02-04 04:27:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 04:27:46,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:46,542 INFO L351 BasicCegarLoop]: trace histogram [10, 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 04:27:46,542 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:46,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1870375513, 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 04:27:46,545 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 30 proven. 91 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 04:27:46,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:46,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:27:46,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 04:27:46,803 INFO L182 omatonBuilderFactory]: Interpolants [5602#true, 5603#false, 5735#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 5736#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5737#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 5738#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 5739#(or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 2))), 5740#(<= |#Ultimate.C_memset_#amount| 2), 5709#(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)|)), 5710#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5711#(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))), 5726#(not (= 8 |zalloc_or_die_#in~size|)), 5727#(= (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 04:27:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 30 proven. 91 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 04:27:46,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:27:46,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:27:46,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:27:46,804 INFO L87 Difference]: Start difference. First operand 405 states and 520 transitions. Second operand 13 states. [2018-02-04 04:27:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:47,843 INFO L93 Difference]: Finished difference Result 468 states and 567 transitions. [2018-02-04 04:27:47,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:27:47,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2018-02-04 04:27:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:47,845 INFO L225 Difference]: With dead ends: 468 [2018-02-04 04:27:47,845 INFO L226 Difference]: Without dead ends: 461 [2018-02-04 04:27:47,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 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 04:27:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-04 04:27:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 406. [2018-02-04 04:27:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-02-04 04:27:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 522 transitions. [2018-02-04 04:27:47,854 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 522 transitions. Word has length 139 [2018-02-04 04:27:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:47,854 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 522 transitions. [2018-02-04 04:27:47,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:27:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 522 transitions. [2018-02-04 04:27:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-04 04:27:47,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:47,856 INFO L351 BasicCegarLoop]: trace histogram [15, 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 04:27:47,856 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:47,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1443053562, 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 04:27:47,864 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 30 proven. 122 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-02-04 04:27:48,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:48,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:27:48,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-02-04 04:27:48,141 INFO L182 omatonBuilderFactory]: Interpolants [6726#true, 6727#false, 6856#(not (= 8 |zalloc_or_die_#in~size|)), 6857#(= (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)), 6866#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 6867#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6868#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 6869#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 6838#(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)|)), 6870#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 6839#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6871#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 6840#(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))), 6872#(not (= 8 |#Ultimate.C_memset_#amount|))] [2018-02-04 04:27:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 30 proven. 122 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-02-04 04:27:48,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:27:48,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:27:48,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:27:48,142 INFO L87 Difference]: Start difference. First operand 406 states and 522 transitions. Second operand 14 states. [2018-02-04 04:27:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:49,180 INFO L93 Difference]: Finished difference Result 471 states and 571 transitions. [2018-02-04 04:27:49,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:27:49,182 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-02-04 04:27:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:49,184 INFO L225 Difference]: With dead ends: 471 [2018-02-04 04:27:49,184 INFO L226 Difference]: Without dead ends: 464 [2018-02-04 04:27:49,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 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 04:27:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-04 04:27:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 407. [2018-02-04 04:27:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-04 04:27:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 524 transitions. [2018-02-04 04:27:49,193 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 524 transitions. Word has length 144 [2018-02-04 04:27:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:49,194 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 524 transitions. [2018-02-04 04:27:49,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:27:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 524 transitions. [2018-02-04 04:27:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 04:27:49,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:49,195 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 04:27:49,195 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1407298681, 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) [2018-02-04 04:27:49,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 30 proven. 162 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-02-04 04:27:49,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:49,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:27:49,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-02-04 04:27:49,621 INFO L182 omatonBuilderFactory]: Interpolants [7872#true, 7873#false, 8008#(not (= 8 |zalloc_or_die_#in~size|)), 8009#(= (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)), 8019#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 8020#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7989#(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)|)), 8021#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 7990#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8022#(= |#Ultimate.C_memset_#t~loopctr49| 1), 7991#(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))), 8023#(= |#Ultimate.C_memset_#t~loopctr49| 2), 8024#(= |#Ultimate.C_memset_#t~loopctr49| 3), 8025#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 4)) (and (< 4 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|))), 8026#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-04 04:27:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 30 proven. 162 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-02-04 04:27:49,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:27:49,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:27:49,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:27:49,622 INFO L87 Difference]: Start difference. First operand 407 states and 524 transitions. Second operand 15 states. [2018-02-04 04:27:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:50,825 INFO L93 Difference]: Finished difference Result 474 states and 575 transitions. [2018-02-04 04:27:50,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:27:50,825 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 149 [2018-02-04 04:27:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:50,827 INFO L225 Difference]: With dead ends: 474 [2018-02-04 04:27:50,827 INFO L226 Difference]: Without dead ends: 467 [2018-02-04 04:27:50,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:27:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-04 04:27:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 408. [2018-02-04 04:27:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 04:27:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 526 transitions. [2018-02-04 04:27:50,833 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 526 transitions. Word has length 149 [2018-02-04 04:27:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:50,833 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 526 transitions. [2018-02-04 04:27:50,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:27:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 526 transitions. [2018-02-04 04:27:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 04:27:50,834 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:50,834 INFO L351 BasicCegarLoop]: trace histogram [25, 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 04:27:50,834 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash -114763302, 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 04:27:50,837 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 30 proven. 211 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-02-04 04:27:51,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:51,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:27:51,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-02-04 04:27:51,220 INFO L182 omatonBuilderFactory]: Interpolants [9162#(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)|)), 9194#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 9163#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9195#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9164#(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))), 9196#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 9197#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 9198#(= |#Ultimate.C_memset_#t~loopctr49| 2), 9199#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 9040#true, 9200#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 9041#false, 9201#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 9202#(not (= 8 |#Ultimate.C_memset_#amount|)), 9182#(not (= 8 |zalloc_or_die_#in~size|)), 9183#(= (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 04:27:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 30 proven. 211 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-02-04 04:27:51,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:27:51,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:27:51,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:27:51,221 INFO L87 Difference]: Start difference. First operand 408 states and 526 transitions. Second operand 16 states. [2018-02-04 04:27:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:52,508 INFO L93 Difference]: Finished difference Result 477 states and 579 transitions. [2018-02-04 04:27:52,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:27:52,509 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 154 [2018-02-04 04:27:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:52,510 INFO L225 Difference]: With dead ends: 477 [2018-02-04 04:27:52,510 INFO L226 Difference]: Without dead ends: 470 [2018-02-04 04:27:52,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:27:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-04 04:27:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 409. [2018-02-04 04:27:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-04 04:27:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 528 transitions. [2018-02-04 04:27:52,516 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 528 transitions. Word has length 154 [2018-02-04 04:27:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:52,516 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 528 transitions. [2018-02-04 04:27:52,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:27:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 528 transitions. [2018-02-04 04:27:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 04:27:52,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:52,518 INFO L351 BasicCegarLoop]: trace histogram [30, 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 04:27:52,518 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1808131737, 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 04:27:52,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 30 proven. 269 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-02-04 04:27:52,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:52,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:27:52,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-02-04 04:27:52,840 INFO L182 omatonBuilderFactory]: Interpolants [10400#(not (= 8 |#Ultimate.C_memset_#amount|)), 10378#(not (= 8 |zalloc_or_die_#in~size|)), 10379#(= (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)), 10357#(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)|)), 10230#true, 10358#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10231#false, 10359#(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))), 10391#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 10392#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10393#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 10394#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 10395#(= |#Ultimate.C_memset_#t~loopctr49| 2), 10396#(= |#Ultimate.C_memset_#t~loopctr49| 3), 10397#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 10398#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 10399#(<= |#Ultimate.C_memset_#t~loopctr49| 6)] [2018-02-04 04:27:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 30 proven. 269 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-02-04 04:27:52,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:27:52,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:27:52,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:27:52,841 INFO L87 Difference]: Start difference. First operand 409 states and 528 transitions. Second operand 17 states. [2018-02-04 04:27:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:54,119 INFO L93 Difference]: Finished difference Result 480 states and 583 transitions. [2018-02-04 04:27:54,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:27:54,120 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 159 [2018-02-04 04:27:54,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:54,121 INFO L225 Difference]: With dead ends: 480 [2018-02-04 04:27:54,121 INFO L226 Difference]: Without dead ends: 473 [2018-02-04 04:27:54,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 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 04:27:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-04 04:27:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 410. [2018-02-04 04:27:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:27:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2018-02-04 04:27:54,130 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 159 [2018-02-04 04:27:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:54,130 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2018-02-04 04:27:54,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:27:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2018-02-04 04:27:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-04 04:27:54,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:54,132 INFO L351 BasicCegarLoop]: trace histogram [35, 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 04:27:54,132 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:54,133 INFO L82 PathProgramCache]: Analyzing trace with hash -194626630, 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 04:27:54,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 30 proven. 336 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-02-04 04:27:54,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:54,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:27:54,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-02-04 04:27:54,442 INFO L182 omatonBuilderFactory]: Interpolants [11616#(= 4 |#Ultimate.C_memset_#t~loopctr49|), 11617#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 11618#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 11619#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 11620#(not (= 8 |#Ultimate.C_memset_#amount|)), 11596#(not (= 8 |zalloc_or_die_#in~size|)), 11597#(= (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)), 11442#true, 11443#false, 11574#(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)|)), 11575#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11576#(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))), 11610#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 11611#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11612#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 11613#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 11614#(= |#Ultimate.C_memset_#t~loopctr49| 2), 11615#(= |#Ultimate.C_memset_#t~loopctr49| 3)] [2018-02-04 04:27:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 30 proven. 336 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-02-04 04:27:54,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:27:54,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:27:54,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:27:54,443 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand 18 states. [2018-02-04 04:27:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:55,644 INFO L93 Difference]: Finished difference Result 483 states and 587 transitions. [2018-02-04 04:27:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:27:55,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 164 [2018-02-04 04:27:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:55,645 INFO L225 Difference]: With dead ends: 483 [2018-02-04 04:27:55,645 INFO L226 Difference]: Without dead ends: 476 [2018-02-04 04:27:55,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:27:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-02-04 04:27:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 411. [2018-02-04 04:27:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 04:27:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 532 transitions. [2018-02-04 04:27:55,651 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 532 transitions. Word has length 164 [2018-02-04 04:27:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:55,651 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 532 transitions. [2018-02-04 04:27:55,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:27:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 532 transitions. [2018-02-04 04:27:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 04:27:55,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:55,652 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 04:27:55,652 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1622825145, 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 04:27:55,662 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,721 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 04:27:55,728 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:55,728 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:55,728 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:55,728 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:55,736 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:55,736 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:55,736 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:55,736 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:27:55,748 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 04:27:55,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:27:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2018-02-04 04:27:55,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:55,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 04:27:55,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-02-04 04:27:55,999 INFO L182 omatonBuilderFactory]: Interpolants [12816#(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)), 12817#(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|)), 12818#(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)))), 12819#(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)|)), 12676#true, 12820#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12677#false, 12854#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12813#(= |zalloc_or_die_#in~size| 119), 12814#(= 119 zalloc_or_die_~size), 12815#(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))] [2018-02-04 04:27:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2018-02-04 04:27:55,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:27:55,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:27:55,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=86, Unknown=2, NotChecked=0, Total=110 [2018-02-04 04:27:56,000 INFO L87 Difference]: Start difference. First operand 411 states and 532 transitions. Second operand 11 states. [2018-02-04 04:27:56,126 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 04:27:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:56,833 INFO L93 Difference]: Finished difference Result 453 states and 557 transitions. [2018-02-04 04:27:56,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:27:56,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2018-02-04 04:27:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:56,836 INFO L225 Difference]: With dead ends: 453 [2018-02-04 04:27:56,836 INFO L226 Difference]: Without dead ends: 453 [2018-02-04 04:27:56,836 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 04:27:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-04 04:27:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-02-04 04:27:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:27:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 531 transitions. [2018-02-04 04:27:56,845 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 531 transitions. Word has length 169 [2018-02-04 04:27:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:56,845 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 531 transitions. [2018-02-04 04:27:56,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:27:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 531 transitions. [2018-02-04 04:27:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 04:27:56,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:56,846 INFO L351 BasicCegarLoop]: trace histogram [40, 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 04:27:56,846 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:56,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1025496070, 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 04:27:56,850 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:27:57,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:27:57,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:27:57,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:27:57,105 INFO L182 omatonBuilderFactory]: Interpolants [14016#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14050#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13860#true, 14196#(not (= 119 |zalloc_or_die_#in~size|)), 13861#false, 14197#(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))), 14183#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 14203#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 14204#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 14205#(<= |#Ultimate.C_memset_#amount| 0), 14015#(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 04:27:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:27:57,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:27:57,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:27:57,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:27:57,105 INFO L87 Difference]: Start difference. First operand 410 states and 531 transitions. Second operand 11 states. [2018-02-04 04:27:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:57,979 INFO L93 Difference]: Finished difference Result 460 states and 563 transitions. [2018-02-04 04:27:57,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:27:57,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 182 [2018-02-04 04:27:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:57,981 INFO L225 Difference]: With dead ends: 460 [2018-02-04 04:27:57,981 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 04:27:57,982 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 04:27:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 04:27:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 04:27:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:27:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2018-02-04 04:27:57,989 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 182 [2018-02-04 04:27:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:57,989 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2018-02-04 04:27:57,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:27:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2018-02-04 04:27:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-04 04:27:57,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:57,990 INFO L351 BasicCegarLoop]: trace histogram [41, 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 04:27:57,990 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1838740207, 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 04:27:57,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 155 proven. 1 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:27:58,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:58,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:27:58,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:27:58,275 INFO L182 omatonBuilderFactory]: Interpolants [15440#(not (= |zalloc_or_die_#in~size| 119)), 15441#(= (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)), 15426#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 15448#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 15449#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 15258#(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)|)), 15450#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 1)) (and (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|))), 15259#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15451#(<= |#Ultimate.C_memset_#amount| 1), 15293#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15102#true, 15103#false] [2018-02-04 04:27:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 155 proven. 1 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:27:58,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:27:58,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:27:58,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:27:58,276 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand 12 states. [2018-02-04 04:27:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:59,145 INFO L93 Difference]: Finished difference Result 460 states and 562 transitions. [2018-02-04 04:27:59,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:27:59,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 183 [2018-02-04 04:27:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:59,147 INFO L225 Difference]: With dead ends: 460 [2018-02-04 04:27:59,147 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 04:27:59,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:27:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 04:27:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 04:27:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:27:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 529 transitions. [2018-02-04 04:27:59,152 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 529 transitions. Word has length 183 [2018-02-04 04:27:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:59,152 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 529 transitions. [2018-02-04 04:27:59,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:27:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 529 transitions. [2018-02-04 04:27:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 04:27:59,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:59,153 INFO L351 BasicCegarLoop]: trace histogram [42, 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 04:27:59,153 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:27:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1279504678, 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 04:27:59,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 200 proven. 3 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:27:59,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:59,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:27:59,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:27:59,457 INFO L182 omatonBuilderFactory]: Interpolants [16680#(not (= |zalloc_or_die_#in~size| 119)), 16681#(and (= calloc_model_~size |calloc_model_#in~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))), 16497#(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)|)), 16689#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 16498#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16690#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 16691#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 16340#true, 16532#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16692#(and (< 1 |#Ultimate.C_memset_#amount|) (or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 2)))), 16341#false, 16693#(= |#Ultimate.C_memset_#amount| 2), 16665#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 04:27:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 200 proven. 3 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:27:59,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:27:59,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:27:59,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:27:59,458 INFO L87 Difference]: Start difference. First operand 410 states and 529 transitions. Second operand 13 states. [2018-02-04 04:28:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:00,309 INFO L93 Difference]: Finished difference Result 460 states and 561 transitions. [2018-02-04 04:28:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:28:00,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 184 [2018-02-04 04:28:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:00,311 INFO L225 Difference]: With dead ends: 460 [2018-02-04 04:28:00,311 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 04:28:00,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:28:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 04:28:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 04:28:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:28:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 528 transitions. [2018-02-04 04:28:00,317 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 528 transitions. Word has length 184 [2018-02-04 04:28:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:00,317 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 528 transitions. [2018-02-04 04:28:00,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:28:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 528 transitions. [2018-02-04 04:28:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 04:28:00,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:00,318 INFO L351 BasicCegarLoop]: trace histogram [43, 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 04:28:00,319 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:00,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1123072463, 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 04:28:00,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 245 proven. 6 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:00,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:00,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:28:00,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:00,682 INFO L182 omatonBuilderFactory]: Interpolants [17930#(not (= |zalloc_or_die_#in~size| 119)), 17931#(= (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)), 17746#(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)|)), 17747#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17588#true, 17940#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 17589#false, 17781#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17941#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 17942#(<= |#Ultimate.C_memset_#t~loopctr49| 1), 17943#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 17944#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 17945#(not (= |#Ultimate.C_memset_#amount| 119)), 17914#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 04:28:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 245 proven. 6 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:00,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:28:00,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:28:00,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:28:00,683 INFO L87 Difference]: Start difference. First operand 410 states and 528 transitions. Second operand 14 states. [2018-02-04 04:28:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:01,629 INFO L93 Difference]: Finished difference Result 460 states and 560 transitions. [2018-02-04 04:28:01,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:28:01,629 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2018-02-04 04:28:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:01,630 INFO L225 Difference]: With dead ends: 460 [2018-02-04 04:28:01,631 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 04:28:01,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:28:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 04:28:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 04:28:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:28:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 527 transitions. [2018-02-04 04:28:01,640 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 527 transitions. Word has length 185 [2018-02-04 04:28:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:01,640 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 527 transitions. [2018-02-04 04:28:01,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:28:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 527 transitions. [2018-02-04 04:28:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-02-04 04:28:01,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:01,641 INFO L351 BasicCegarLoop]: trace histogram [44, 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 04:28:01,642 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:01,642 INFO L82 PathProgramCache]: Analyzing trace with hash -568641094, 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 04:28:01,651 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 290 proven. 10 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:01,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:01,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:28:01,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:01,999 INFO L182 omatonBuilderFactory]: Interpolants [19178#(not (= |zalloc_or_die_#in~size| 119)), 19179#(= (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)), 18993#(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)|)), 18834#true, 18994#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18835#false, 19028#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19189#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 19190#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 19191#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 19192#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 19161#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 19193#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 19194#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 19195#(not (= |#Ultimate.C_memset_#amount| 119))] [2018-02-04 04:28:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 290 proven. 10 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:01,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:28:01,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:28:01,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:28:01,999 INFO L87 Difference]: Start difference. First operand 410 states and 527 transitions. Second operand 15 states. [2018-02-04 04:28:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:03,160 INFO L93 Difference]: Finished difference Result 460 states and 559 transitions. [2018-02-04 04:28:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:28:03,160 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2018-02-04 04:28:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:03,161 INFO L225 Difference]: With dead ends: 460 [2018-02-04 04:28:03,161 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 04:28:03,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:28:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 04:28:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 04:28:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:28:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 526 transitions. [2018-02-04 04:28:03,167 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 526 transitions. Word has length 186 [2018-02-04 04:28:03,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:03,168 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 526 transitions. [2018-02-04 04:28:03,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:28:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 526 transitions. [2018-02-04 04:28:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 04:28:03,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:03,169 INFO L351 BasicCegarLoop]: trace histogram [45, 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 04:28:03,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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:03,169 INFO L82 PathProgramCache]: Analyzing trace with hash -561137839, 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 04:28:03,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 335 proven. 15 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:03,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:03,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:28:03,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:03,510 INFO L182 omatonBuilderFactory]: Interpolants [20448#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 5)) (and (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|) (< 5 |#Ultimate.C_memset_#amount|))), 20449#(<= |#Ultimate.C_memset_#amount| 5), 20430#(not (= |zalloc_or_die_#in~size| 119)), 20431#(= (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)), 20084#true, 20244#(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)|)), 20085#false, 20245#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20279#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20442#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 20443#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 20412#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 20444#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 20445#(= |#Ultimate.C_memset_#t~loopctr49| 2), 20446#(= |#Ultimate.C_memset_#t~loopctr49| 3), 20447#(= 4 |#Ultimate.C_memset_#t~loopctr49|)] [2018-02-04 04:28:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 335 proven. 15 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:03,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:28:03,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:28:03,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:28:03,511 INFO L87 Difference]: Start difference. First operand 410 states and 526 transitions. Second operand 16 states. [2018-02-04 04:28:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:04,584 INFO L93 Difference]: Finished difference Result 460 states and 558 transitions. [2018-02-04 04:28:04,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:28:04,584 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 187 [2018-02-04 04:28:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:04,585 INFO L225 Difference]: With dead ends: 460 [2018-02-04 04:28:04,586 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 04:28:04,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:28:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 04:28:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 04:28:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:28:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 525 transitions. [2018-02-04 04:28:04,590 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 525 transitions. Word has length 187 [2018-02-04 04:28:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:04,590 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 525 transitions. [2018-02-04 04:28:04,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:28:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 525 transitions. [2018-02-04 04:28:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-04 04:28:04,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:04,591 INFO L351 BasicCegarLoop]: trace histogram [46, 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 04:28:04,591 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:04,591 INFO L82 PathProgramCache]: Analyzing trace with hash -328536934, 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 04:28:04,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 380 proven. 21 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:04,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:04,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:28:04,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:04,930 INFO L182 omatonBuilderFactory]: Interpolants [21667#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 21699#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 21700#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 21701#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 21702#(= |#Ultimate.C_memset_#t~loopctr49| 2), 21703#(= |#Ultimate.C_memset_#t~loopctr49| 3), 21704#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 21705#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 21706#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 21707#(not (= |#Ultimate.C_memset_#amount| 119)), 21686#(not (= |zalloc_or_die_#in~size| 119)), 21687#(= (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)), 21338#true, 21339#false, 21499#(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)|)), 21500#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21534#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:28:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 380 proven. 21 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:04,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:28:04,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:28:04,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:28:04,931 INFO L87 Difference]: Start difference. First operand 410 states and 525 transitions. Second operand 17 states. [2018-02-04 04:28:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:06,015 INFO L93 Difference]: Finished difference Result 460 states and 557 transitions. [2018-02-04 04:28:06,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:28:06,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 188 [2018-02-04 04:28:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:06,016 INFO L225 Difference]: With dead ends: 460 [2018-02-04 04:28:06,016 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 04:28:06,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:28:06,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 04:28:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 04:28:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:28:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 524 transitions. [2018-02-04 04:28:06,021 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 524 transitions. Word has length 188 [2018-02-04 04:28:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:06,021 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 524 transitions. [2018-02-04 04:28:06,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:28:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 524 transitions. [2018-02-04 04:28:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 04:28:06,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:06,022 INFO L351 BasicCegarLoop]: trace histogram [47, 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 04:28:06,022 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1707843471, 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 04:28:06,024 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 425 proven. 28 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:06,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:06,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:28:06,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:06,427 INFO L182 omatonBuilderFactory]: Interpolants [22946#(not (= |zalloc_or_die_#in~size| 119)), 22947#(= (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)), 22596#true, 22597#false, 22758#(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)|)), 22759#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22793#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22926#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 22960#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 22961#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 22962#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 22963#(= |#Ultimate.C_memset_#t~loopctr49| 2), 22964#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 22965#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 22966#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 22967#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 22968#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 22969#(not (= |#Ultimate.C_memset_#amount| 119))] [2018-02-04 04:28:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 425 proven. 28 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:06,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:28:06,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:28:06,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:28:06,428 INFO L87 Difference]: Start difference. First operand 410 states and 524 transitions. Second operand 18 states. [2018-02-04 04:28:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:07,639 INFO L93 Difference]: Finished difference Result 458 states and 554 transitions. [2018-02-04 04:28:07,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:28:07,640 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 189 [2018-02-04 04:28:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:07,641 INFO L225 Difference]: With dead ends: 458 [2018-02-04 04:28:07,641 INFO L226 Difference]: Without dead ends: 449 [2018-02-04 04:28:07,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:28:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-04 04:28:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 408. [2018-02-04 04:28:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 04:28:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 521 transitions. [2018-02-04 04:28:07,645 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 521 transitions. Word has length 189 [2018-02-04 04:28:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:07,645 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 521 transitions. [2018-02-04 04:28:07,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:28:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 521 transitions. [2018-02-04 04:28:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-04 04:28:07,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:07,646 INFO L351 BasicCegarLoop]: trace histogram [48, 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 04:28:07,646 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1516673158, 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 04:28:07,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 470 proven. 36 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:07,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:07,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 04:28:07,973 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:07,974 INFO L182 omatonBuilderFactory]: Interpolants [24224#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 24225#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 24226#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 24227#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 24228#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 24229#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 24230#(<= |#Ultimate.C_memset_#t~loopctr49| 8), 24231#(not (= |#Ultimate.C_memset_#amount| 119)), 23854#true, 24206#(not (= |zalloc_or_die_#in~size| 119)), 23855#false, 24207#(= (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)), 24017#(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)|)), 24018#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24052#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24185#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 24221#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 24222#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 24223#(<= |#Ultimate.C_memset_#t~loopctr49| 1)] [2018-02-04 04:28:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 470 proven. 36 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:07,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:28:07,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:28:07,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:28:07,975 INFO L87 Difference]: Start difference. First operand 408 states and 521 transitions. Second operand 19 states. [2018-02-04 04:28:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:09,003 INFO L93 Difference]: Finished difference Result 462 states and 559 transitions. [2018-02-04 04:28:09,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:28:09,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2018-02-04 04:28:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:09,005 INFO L225 Difference]: With dead ends: 462 [2018-02-04 04:28:09,005 INFO L226 Difference]: Without dead ends: 455 [2018-02-04 04:28:09,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:28:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-04 04:28:09,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-02-04 04:28:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 04:28:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 525 transitions. [2018-02-04 04:28:09,011 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 525 transitions. Word has length 190 [2018-02-04 04:28:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:09,012 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 525 transitions. [2018-02-04 04:28:09,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:28:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 525 transitions. [2018-02-04 04:28:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-04 04:28:09,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:09,013 INFO L351 BasicCegarLoop]: trace histogram [49, 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 04:28:09,013 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:09,013 INFO L82 PathProgramCache]: Analyzing trace with hash 114639249, 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 04:28:09,017 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 515 proven. 45 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:09,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:09,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 04:28:09,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:09,286 INFO L182 omatonBuilderFactory]: Interpolants [25504#(not (= |#Ultimate.C_memset_#amount| 119)), 25123#true, 25124#false, 25477#(not (= |zalloc_or_die_#in~size| 119)), 25478#(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)))), 25287#(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)|)), 25288#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25322#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25455#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 25493#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 25494#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 25495#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 25496#(= |#Ultimate.C_memset_#t~loopctr49| 2), 25497#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 25498#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 25499#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 25500#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 25501#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 25502#(<= |#Ultimate.C_memset_#t~loopctr49| 8), 25503#(<= |#Ultimate.C_memset_#t~loopctr49| 9)] [2018-02-04 04:28:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 515 proven. 45 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:09,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:28:09,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:28:09,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:28:09,287 INFO L87 Difference]: Start difference. First operand 411 states and 525 transitions. Second operand 20 states. [2018-02-04 04:28:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:10,652 INFO L93 Difference]: Finished difference Result 462 states and 560 transitions. [2018-02-04 04:28:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:28:10,652 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 191 [2018-02-04 04:28:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:10,653 INFO L225 Difference]: With dead ends: 462 [2018-02-04 04:28:10,653 INFO L226 Difference]: Without dead ends: 455 [2018-02-04 04:28:10,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:28:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-04 04:28:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 412. [2018-02-04 04:28:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-04 04:28:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 527 transitions. [2018-02-04 04:28:10,658 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 527 transitions. Word has length 191 [2018-02-04 04:28:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:10,658 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 527 transitions. [2018-02-04 04:28:10,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:28:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 527 transitions. [2018-02-04 04:28:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 04:28:10,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:10,659 INFO L351 BasicCegarLoop]: trace histogram [50, 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 04:28:10,659 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:10,659 INFO L82 PathProgramCache]: Analyzing trace with hash -854283686, 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 04:28:10,662 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 560 proven. 55 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:11,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:11,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 04:28:11,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:11,280 INFO L182 omatonBuilderFactory]: Interpolants [26784#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 26785#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6)), 26786#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 26787#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8)), 26788#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 26405#true, 26789#(and (< 9 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 26406#false, 26790#(and (<= |#Ultimate.C_memset_#amount| 10) (< 9 |#Ultimate.C_memset_#amount|)), 26761#(not (= |zalloc_or_die_#in~size| 119)), 26570#(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)|)), 26762#(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)))), 26571#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26605#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26738#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 26778#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 26779#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 26780#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 26781#(= |#Ultimate.C_memset_#t~loopctr49| 2), 26782#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|)), 26783#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|))] [2018-02-04 04:28:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 560 proven. 55 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:11,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:28:11,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:28:11,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:28:11,281 INFO L87 Difference]: Start difference. First operand 412 states and 527 transitions. Second operand 21 states. [2018-02-04 04:28:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:12,704 INFO L93 Difference]: Finished difference Result 468 states and 567 transitions. [2018-02-04 04:28:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:28:12,704 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2018-02-04 04:28:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:12,706 INFO L225 Difference]: With dead ends: 468 [2018-02-04 04:28:12,706 INFO L226 Difference]: Without dead ends: 461 [2018-02-04 04:28:12,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:28:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-04 04:28:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 413. [2018-02-04 04:28:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-04 04:28:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 529 transitions. [2018-02-04 04:28:12,710 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 529 transitions. Word has length 192 [2018-02-04 04:28:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:12,712 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 529 transitions. [2018-02-04 04:28:12,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:28:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 529 transitions. [2018-02-04 04:28:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 04:28:12,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:12,713 INFO L351 BasicCegarLoop]: trace histogram [51, 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 04:28:12,713 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:12,713 INFO L82 PathProgramCache]: Analyzing trace with hash -826123599, 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 04:28:12,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1851 backedges. 605 proven. 66 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:13,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:13,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 04:28:13,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:13,895 INFO L182 omatonBuilderFactory]: Interpolants [28066#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 28067#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 28068#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 28069#(and (= |#Ultimate.C_memset_#t~loopctr49| 2) (< 1 |#Ultimate.C_memset_#amount|)), 28070#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|) (< 1 |#Ultimate.C_memset_#amount|)), 28071#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|) (< 1 |#Ultimate.C_memset_#amount|)), 28072#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 28073#(and (<= |#Ultimate.C_memset_#t~loopctr49| 6) (< 1 |#Ultimate.C_memset_#amount|)), 27690#true, 28074#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 27691#false, 28075#(and (<= |#Ultimate.C_memset_#t~loopctr49| 8) (< 1 |#Ultimate.C_memset_#amount|)), 28076#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (< 1 |#Ultimate.C_memset_#amount|)), 28077#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 28078#(and (<= |#Ultimate.C_memset_#t~loopctr49| 11) (< 1 |#Ultimate.C_memset_#amount|)), 28079#(and (<= 0 (+ (div (+ (- 9663676119) (* (- 27) |#Ultimate.C_memset_#amount|)) 1073741824) 11)) (< 1 |#Ultimate.C_memset_#amount|)), 27856#(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)|)), 28048#(not (= |zalloc_or_die_#in~size| 119)), 27857#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28049#(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)))), 27891#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28024#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 04:28:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1851 backedges. 605 proven. 66 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:13,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:28:13,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:28:13,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:28:13,896 INFO L87 Difference]: Start difference. First operand 413 states and 529 transitions. Second operand 22 states. [2018-02-04 04:28:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:20,715 INFO L93 Difference]: Finished difference Result 471 states and 571 transitions. [2018-02-04 04:28:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:28:20,716 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2018-02-04 04:28:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:20,717 INFO L225 Difference]: With dead ends: 471 [2018-02-04 04:28:20,717 INFO L226 Difference]: Without dead ends: 464 [2018-02-04 04:28:20,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:28:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-04 04:28:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 414. [2018-02-04 04:28:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-04 04:28:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 531 transitions. [2018-02-04 04:28:20,721 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 531 transitions. Word has length 193 [2018-02-04 04:28:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:20,721 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 531 transitions. [2018-02-04 04:28:20,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:28:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 531 transitions. [2018-02-04 04:28:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-04 04:28:20,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:20,722 INFO L351 BasicCegarLoop]: trace histogram [52, 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 04:28:20,722 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash 46839098, 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 04:28:20,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 650 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:21,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:21,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 04:28:21,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:21,201 INFO L182 omatonBuilderFactory]: Interpolants [29376#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 29377#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8) (< 0 |#Ultimate.C_memset_#amount|)), 29378#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (< 0 |#Ultimate.C_memset_#amount|) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 29379#(and (<= 10 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 29156#(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)|)), 29380#(and (<= 11 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 11) (< 0 |#Ultimate.C_memset_#amount|)), 29157#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29381#(and (<= |#Ultimate.C_memset_#t~loopctr49| 12) (< 11 |#Ultimate.C_memset_#amount|)), 29349#(not (= |zalloc_or_die_#in~size| 119)), 29350#(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)))), 29382#(and (< 11 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 12)), 29191#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29324#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 29368#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 29369#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 29370#(and (= 1 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|)), 29371#(and (<= 2 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 2)), 29372#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|)), 28989#true, 29373#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|)), 28990#false, 29374#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 29375#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6) (< 0 |#Ultimate.C_memset_#amount|))] [2018-02-04 04:28:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 650 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:28:21,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:28:21,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:28:21,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:28:21,201 INFO L87 Difference]: Start difference. First operand 414 states and 531 transitions. Second operand 23 states. [2018-02-04 04:28:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:28:22,724 INFO L93 Difference]: Finished difference Result 474 states and 575 transitions. [2018-02-04 04:28:22,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:28:22,724 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 194 [2018-02-04 04:28:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:28:22,726 INFO L225 Difference]: With dead ends: 474 [2018-02-04 04:28:22,726 INFO L226 Difference]: Without dead ends: 467 [2018-02-04 04:28:22,726 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 04:28:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-04 04:28:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 415. [2018-02-04 04:28:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-02-04 04:28:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 533 transitions. [2018-02-04 04:28:22,730 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 533 transitions. Word has length 194 [2018-02-04 04:28:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:28:22,730 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 533 transitions. [2018-02-04 04:28:22,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:28:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 533 transitions. [2018-02-04 04:28:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-04 04:28:22,731 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:28:22,731 INFO L351 BasicCegarLoop]: trace histogram [53, 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 04:28:22,731 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:28:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1338878929, now seen corresponding path program 14 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 04:28:22,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:28:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:28:25,225 WARN L1033 $PredicateComparison]: unable to prove that (and (< 12 |c_#Ultimate.C_memset_#amount|) (<= (* 53 |c_#Ultimate.C_memset_#t~loopctr49|) (+ (div (+ (- 19327352143) (* 2147483595 |c_#Ultimate.C_memset_#amount|)) 2147483648) 2147484284))) is different from true [2018-02-04 04:28:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 695 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 13 not checked. [2018-02-04 04:28:34,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:28:34,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 04:28:34,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:28:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:28:34,187 INFO L182 omatonBuilderFactory]: Interpolants [30626#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 30672#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 30673#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 30290#true, 30674#(and (<= 1 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 1)), 30291#false, 30675#(and (<= 2 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 2)), 30676#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|)), 30677#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|)), 30678#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 30679#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6)), 30680#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 30681#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8)), 30458#(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)|)), 30682#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 30459#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30683#(and (<= 10 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 30684#(and (<= 11 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 11)), 30652#(not (= |zalloc_or_die_#in~size| 119)), 30493#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30653#(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)))), 30685#(and (<= |#Ultimate.C_memset_#t~loopctr49| 12) (<= 12 |#Ultimate.C_memset_#t~loopctr49|)), 30686#(and (< 12 |#Ultimate.C_memset_#amount|) (<= (* 53 |#Ultimate.C_memset_#t~loopctr49|) (+ (div (+ (- 19327352143) (* 2147483595 |#Ultimate.C_memset_#amount|)) 2147483648) 2147484284))), 30687#(and (< 12 |#Ultimate.C_memset_#amount|) (<= (* 2147483648 |#Ultimate.C_memset_#amount|) (+ (* 2147483595 |#Ultimate.C_memset_#t~loopctr49|) (div (+ (- 19327352143) (* 2147483595 |#Ultimate.C_memset_#amount|)) 2147483648) 2147484284)))] [2018-02-04 04:28:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 695 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 13 not checked. [2018-02-04 04:28:34,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:28:34,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:28:34,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=4, NotChecked=42, Total=552 [2018-02-04 04:28:34,188 INFO L87 Difference]: Start difference. First operand 415 states and 533 transitions. Second operand 24 states. [2018-02-04 04:29:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:29:15,780 INFO L93 Difference]: Finished difference Result 477 states and 579 transitions. [2018-02-04 04:29:15,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:29:15,780 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 195 [2018-02-04 04:29:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:29:15,781 INFO L225 Difference]: With dead ends: 477 [2018-02-04 04:29:15,781 INFO L226 Difference]: Without dead ends: 470 [2018-02-04 04:29:15,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=95, Invalid=834, Unknown=5, NotChecked=58, Total=992 [2018-02-04 04:29:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-04 04:29:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 416. [2018-02-04 04:29:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-02-04 04:29:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 535 transitions. [2018-02-04 04:29:15,785 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 535 transitions. Word has length 195 [2018-02-04 04:29:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:29:15,785 INFO L432 AbstractCegarLoop]: Abstraction has 416 states and 535 transitions. [2018-02-04 04:29:15,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:29:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 535 transitions. [2018-02-04 04:29:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-04 04:29:15,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:29:15,786 INFO L351 BasicCegarLoop]: trace histogram [54, 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 04:29:15,786 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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 04:29:15,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1557559270, now seen corresponding path program 15 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 04:29:15,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:29:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:29:24,741 WARN L143 SmtUtils]: Spent 2012ms on a formula simplification that was a NOOP. DAG size: 17 [2018-02-04 04:29:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 740 proven. 105 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:29:24,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:29:24,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 04:29:24,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:29:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 04:29:24,778 INFO L182 omatonBuilderFactory]: Interpolants [31766#(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)|)), 31767#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 31961#(not (= |zalloc_or_die_#in~size| 119)), 31962#(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)))), 31597#true, 31598#false, 31982#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 31983#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 31984#(and (<= 1 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 1)), 31985#(and (<= 2 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 2)), 31986#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|)), 31987#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|)), 31988#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 31989#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6)), 31990#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 31991#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8)), 31992#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 31801#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 31993#(and (<= 10 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 31994#(and (<= 11 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 11)), 31995#(and (<= |#Ultimate.C_memset_#t~loopctr49| 12) (<= 12 |#Ultimate.C_memset_#t~loopctr49|)), 31996#(and (<= 13 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 13)), 31997#(and (< 13 |#Ultimate.C_memset_#amount|) (<= (* 105 |#Ultimate.C_memset_#t~loopctr49|) (+ (div (+ (- 47244638786) (* 4294967191 |#Ultimate.C_memset_#amount|)) 4294967296) 4294968661))), 31934#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 31998#(and (< 13 |#Ultimate.C_memset_#amount|) (<= (* 4294967296 |#Ultimate.C_memset_#amount|) (+ (* 4294967191 |#Ultimate.C_memset_#t~loopctr49|) (div (+ (- 47244638786) (* 4294967191 |#Ultimate.C_memset_#amount|)) 4294967296) 4294968661)))] [2018-02-04 04:29:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 740 proven. 105 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:29:24,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:29:24,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:29:24,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=547, Unknown=3, NotChecked=0, Total=600 [2018-02-04 04:29:24,779 INFO L87 Difference]: Start difference. First operand 416 states and 535 transitions. Second operand 25 states. Received shutdown request... [2018-02-04 04:31:17,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:31:17,067 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:31:17,073 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:31:17,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:31:17 BoogieIcfgContainer [2018-02-04 04:31:17,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:31:17,075 INFO L168 Benchmark]: Toolchain (without parser) took 217609.38 ms. Allocated memory was 406.8 MB in the beginning and 1.0 GB in the end (delta: 623.9 MB). Free memory was 360.9 MB in the beginning and 616.1 MB in the end (delta: -255.2 MB). Peak memory consumption was 368.7 MB. Max. memory is 5.3 GB. [2018-02-04 04:31:17,076 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 406.8 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:31:17,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.62 ms. Allocated memory is still 406.8 MB. Free memory was 360.9 MB in the beginning and 347.5 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:31:17,076 INFO L168 Benchmark]: Boogie Preprocessor took 33.76 ms. Allocated memory is still 406.8 MB. Free memory was 347.5 MB in the beginning and 346.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:31:17,077 INFO L168 Benchmark]: RCFGBuilder took 1133.00 ms. Allocated memory is still 406.8 MB. Free memory was 346.2 MB in the beginning and 285.3 MB in the end (delta: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:31:17,077 INFO L168 Benchmark]: TraceAbstraction took 216223.67 ms. Allocated memory was 406.8 MB in the beginning and 1.0 GB in the end (delta: 623.9 MB). Free memory was 285.3 MB in the beginning and 616.1 MB in the end (delta: -330.8 MB). Peak memory consumption was 293.1 MB. Max. memory is 5.3 GB. [2018-02-04 04:31:17,079 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.16 ms. Allocated memory is still 406.8 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.62 ms. Allocated memory is still 406.8 MB. Free memory was 360.9 MB in the beginning and 347.5 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.76 ms. Allocated memory is still 406.8 MB. Free memory was 347.5 MB in the beginning and 346.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1133.00 ms. Allocated memory is still 406.8 MB. Free memory was 346.2 MB in the beginning and 285.3 MB in the end (delta: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 216223.67 ms. Allocated memory was 406.8 MB in the beginning and 1.0 GB in the end (delta: 623.9 MB). Free memory was 285.3 MB in the beginning and 616.1 MB in the end (delta: -330.8 MB). Peak memory consumption was 293.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 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 (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (416states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (416 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 275 locations, 85 error locations. TIMEOUT Result, 216.1s OverallTime, 28 OverallIterations, 54 TraceHistogramMax, 186.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6831 SDtfs, 6793 SDslu, 49086 SDs, 0 SdLazy, 55650 SolverSat, 1782 SolverUnsat, 72 SolverUnknown, 0 SolverNotchecked, 168.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1513 GetRequests, 875 SyntacticMatches, 0 SemanticMatches, 638 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 33.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=416occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 28055/29885 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, 27 MinimizatonAttempts, 1265 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 27.3s InterpolantComputationTime, 4218 NumberOfCodeBlocks, 4218 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4190 ConstructedInterpolants, 8 QuantifiedInterpolants, 2206685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 28055/29885 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-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-31-17-087.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-31-17-087.csv Completed graceful shutdown