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-0234_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:31:21,740 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:31:21,741 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:31:21,754 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:31:21,755 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:31:21,755 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:31:21,756 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:31:21,758 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:31:21,760 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:31:21,760 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:31:21,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:31:21,762 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:31:21,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:31:21,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:31:21,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:31:21,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:31:21,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:31:21,769 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:31:21,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:31:21,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:31:21,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:31:21,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:31:21,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:31:21,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:31:21,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:31:21,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:31:21,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:31:21,777 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:31:21,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:31:21,777 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:31:21,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:31:21,778 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:31:21,788 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:31:21,788 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:31:21,789 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:31:21,790 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:31:21,790 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:31:21,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:31:21,790 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:31:21,790 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:31:21,790 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:31:21,790 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:31:21,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:31:21,790 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:31:21,791 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:31:21,791 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:31:21,791 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:31:21,791 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:31:21,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:31:21,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:31:21,791 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:31:21,791 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:31:21,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:31:21,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:31:21,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 04:31:21,792 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 04:31:21,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:31:21,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:31:21,831 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:31:21,834 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:31:21,836 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:31:21,836 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:31:21,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0234_false-valid-memtrack.i [2018-02-04 04:31:21,975 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:31:21,976 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:31:21,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:31:21,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:31:21,982 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:31:21,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:31:21" (1/1) ... [2018-02-04 04:31:21,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49389d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:21, skipping insertion in model container [2018-02-04 04:31:21,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:31:21" (1/1) ... [2018-02-04 04:31:22,000 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:31:22,035 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:31:22,141 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:31:22,163 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:31:22,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:22 WrapperNode [2018-02-04 04:31:22,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:31:22,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:31:22,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:31:22,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:31:22,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:22" (1/1) ... [2018-02-04 04:31:22,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:22" (1/1) ... [2018-02-04 04:31:22,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:22" (1/1) ... [2018-02-04 04:31:22,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:22" (1/1) ... [2018-02-04 04:31:22,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:22" (1/1) ... [2018-02-04 04:31:22,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:22" (1/1) ... [2018-02-04 04:31:22,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:22" (1/1) ... [2018-02-04 04:31:22,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:31:22,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:31:22,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:31:22,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:31:22,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:22" (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:31:22,253 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:31:22,253 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:31:22,253 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 04:31:22,254 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 04:31:22,255 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 04:31:22,255 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:31:22,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:31:22,509 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 04:31:22,702 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:31:22,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:31:22 BoogieIcfgContainer [2018-02-04 04:31:22,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:31:22,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:31:22,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:31:22,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:31:22,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:31:21" (1/3) ... [2018-02-04 04:31:22,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c71c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:31:22, skipping insertion in model container [2018-02-04 04:31:22,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:31:22" (2/3) ... [2018-02-04 04:31:22,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c71c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:31:22, skipping insertion in model container [2018-02-04 04:31:22,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:31:22" (3/3) ... [2018-02-04 04:31:22,709 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0234_false-valid-memtrack.i [2018-02-04 04:31:22,715 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:31:22,723 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-02-04 04:31:22,749 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:31:22,749 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:31:22,749 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 04:31:22,749 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 04:31:22,749 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:31:22,749 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:31:22,749 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:31:22,749 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:31:22,750 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:31:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2018-02-04 04:31:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:31:22,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:22,770 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:31:22,770 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 11876704, 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:31:22,781 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:22,812 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:31:22,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:31:22,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:31:22,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:22,833 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:31:22,833 INFO L182 omatonBuilderFactory]: Interpolants [227#true, 228#false, 229#(= 1 (select |#valid| |~#list~0.base|))] [2018-02-04 04:31:22,834 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:31:22,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:31:22,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:31:22,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:31:22,844 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2018-02-04 04:31:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:22,970 INFO L93 Difference]: Finished difference Result 254 states and 273 transitions. [2018-02-04 04:31:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:31:22,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 04:31:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:22,982 INFO L225 Difference]: With dead ends: 254 [2018-02-04 04:31:22,982 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 04:31:22,984 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:31:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 04:31:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 219. [2018-02-04 04:31:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 04:31:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-04 04:31:23,098 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 4 [2018-02-04 04:31:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:23,098 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-04 04:31:23,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:31:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-04 04:31:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:31:23,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:23,099 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:31:23,099 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash 11876705, 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:31:23,104 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:23,117 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:31:23,121 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,121 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,122 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,122 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,156 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:31:23,185 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:31:23,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:31:23,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:31:23,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:23,218 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:31:23,218 INFO L182 omatonBuilderFactory]: Interpolants [704#false, 705#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 706#(and (<= (+ |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (= 4 (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|)), 703#true] [2018-02-04 04:31:23,218 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:31:23,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:31:23,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:31:23,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:31:23,221 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 4 states. [2018-02-04 04:31:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:23,343 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2018-02-04 04:31:23,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:31:23,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 04:31:23,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:23,346 INFO L225 Difference]: With dead ends: 226 [2018-02-04 04:31:23,346 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 04:31:23,347 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:31:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 04:31:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2018-02-04 04:31:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 04:31:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-04 04:31:23,359 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 4 [2018-02-04 04:31:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:23,359 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-04 04:31:23,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:31:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-04 04:31:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:31:23,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:23,360 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:31:23,360 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:23,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1969754800, 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:31:23,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:23,380 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:31:23,382 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,382 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,382 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,383 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,387 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:31:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:23,416 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:31:23,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:31:23,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:31:23,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:23,447 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:31:23,447 INFO L182 omatonBuilderFactory]: Interpolants [1152#false, 1158#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 1159#(= 1 (select |#valid| |calloc_model_#t~malloc0.base|)), 1160#(= 1 (select |#valid| calloc_model_~ptr~0.base)), 1161#(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)|)), 1151#true] [2018-02-04 04:31:23,447 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:31:23,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:31:23,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:31:23,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-02-04 04:31:23,448 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 6 states. [2018-02-04 04:31:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:23,891 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2018-02-04 04:31:23,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:31:23,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 04:31:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:23,893 INFO L225 Difference]: With dead ends: 250 [2018-02-04 04:31:23,894 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 04:31:23,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=27, Unknown=3, NotChecked=10, Total=56 [2018-02-04 04:31:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 04:31:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 217. [2018-02-04 04:31:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 04:31:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-04 04:31:23,905 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 17 [2018-02-04 04:31:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:23,905 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-04 04:31:23,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:31:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-04 04:31:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:31:23,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:23,906 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:31:23,906 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:23,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1969754799, 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:31:23,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:23,924 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 04:31:23,953 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,954 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,954 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:23,954 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:24,011 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:24,012 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:24,012 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:24,013 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,108 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:31:24,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:31:24,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:31:24,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:24,125 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:31:24,125 INFO L182 omatonBuilderFactory]: Interpolants [1633#true, 1634#false, 1640#(= |zalloc_or_die_#in~size| 8), 1641#(= 8 zalloc_or_die_~size), 1642#(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)), 1643#(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)), 1644#(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|)), 1645#(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)))), 1646#(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:31:24,126 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:31:24,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:31:24,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:31:24,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=56, Unknown=1, NotChecked=0, Total=72 [2018-02-04 04:31:24,126 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 9 states. [2018-02-04 04:31:24,212 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:31:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:24,773 INFO L93 Difference]: Finished difference Result 263 states and 285 transitions. [2018-02-04 04:31:24,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:31:24,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 04:31:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:24,777 INFO L225 Difference]: With dead ends: 263 [2018-02-04 04:31:24,777 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 04:31:24,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=121, Unknown=3, NotChecked=22, Total=182 [2018-02-04 04:31:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 04:31:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 230. [2018-02-04 04:31:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-04 04:31:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 245 transitions. [2018-02-04 04:31:24,787 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 245 transitions. Word has length 17 [2018-02-04 04:31:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:24,788 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 245 transitions. [2018-02-04 04:31:24,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:31:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 245 transitions. [2018-02-04 04:31:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 04:31:24,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:24,791 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:31:24,794 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1886446230, 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:31:24,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:25,083 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:31:25,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:31:25,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:31:25,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:25,102 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:31:25,102 INFO L182 omatonBuilderFactory]: Interpolants [2338#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 8))), 2339#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 2340#(<= |#Ultimate.C_memset_#amount| 0), 2150#true, 2151#false, 2247#(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)|)), 2248#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2266#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2331#(not (= 8 |zalloc_or_die_#in~size|)), 2332#(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)))), 2318#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 04:31:25,103 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:31:25,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:31:25,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:31:25,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:31:25,103 INFO L87 Difference]: Start difference. First operand 230 states and 245 transitions. Second operand 11 states. [2018-02-04 04:31:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:26,193 INFO L93 Difference]: Finished difference Result 277 states and 298 transitions. [2018-02-04 04:31:26,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:31:26,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-02-04 04:31:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:26,195 INFO L225 Difference]: With dead ends: 277 [2018-02-04 04:31:26,195 INFO L226 Difference]: Without dead ends: 270 [2018-02-04 04:31:26,195 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:31:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-04 04:31:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 233. [2018-02-04 04:31:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 04:31:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 249 transitions. [2018-02-04 04:31:26,202 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 249 transitions. Word has length 129 [2018-02-04 04:31:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:26,202 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 249 transitions. [2018-02-04 04:31:26,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:31:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 249 transitions. [2018-02-04 04:31:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 04:31:26,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:26,204 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:31:26,204 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:26,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1649639724, 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:31:26,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:26,575 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:31:26,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:26,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:31:26,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:26,597 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:31:26,597 INFO L182 omatonBuilderFactory]: Interpolants [2976#(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))), 2998#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 2999#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2872#true, 3000#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 2873#false, 3001#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 3002#(not (= 8 |#Ultimate.C_memset_#amount|)), 2974#(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)|)), 2990#(not (= 8 |zalloc_or_die_#in~size|)), 2975#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2991#(= (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:31:26,597 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:31:26,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:31:26,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:31:26,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:31:26,598 INFO L87 Difference]: Start difference. First operand 233 states and 249 transitions. Second operand 12 states. [2018-02-04 04:31:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:27,525 INFO L93 Difference]: Finished difference Result 283 states and 305 transitions. [2018-02-04 04:31:27,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:31:27,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2018-02-04 04:31:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:27,528 INFO L225 Difference]: With dead ends: 283 [2018-02-04 04:31:27,528 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 04:31:27,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:31:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 04:31:27,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 234. [2018-02-04 04:31:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 04:31:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 251 transitions. [2018-02-04 04:31:27,533 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 251 transitions. Word has length 134 [2018-02-04 04:31:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:27,534 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 251 transitions. [2018-02-04 04:31:27,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:31:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 251 transitions. [2018-02-04 04:31:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 04:31:27,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:27,535 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:31:27,535 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:27,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2139353386, 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:31:27,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:27,787 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:31:27,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:27,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:31:27,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:27,804 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:31:27,805 INFO L182 omatonBuilderFactory]: Interpolants [3745#(not (= 8 |zalloc_or_die_#in~size|)), 3746#(= (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)), 3621#true, 3622#false, 3754#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 3755#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3756#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 3757#(<= |#Ultimate.C_memset_#t~loopctr41| 1), 3758#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 3759#(not (= 8 |#Ultimate.C_memset_#amount|)), 3728#(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)|)), 3729#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3730#(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:31:27,805 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:31:27,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:31:27,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:31:27,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:31:27,805 INFO L87 Difference]: Start difference. First operand 234 states and 251 transitions. Second operand 13 states. [2018-02-04 04:31:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:28,668 INFO L93 Difference]: Finished difference Result 286 states and 309 transitions. [2018-02-04 04:31:28,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:31:28,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2018-02-04 04:31:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:28,669 INFO L225 Difference]: With dead ends: 286 [2018-02-04 04:31:28,669 INFO L226 Difference]: Without dead ends: 279 [2018-02-04 04:31:28,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:31:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-04 04:31:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 235. [2018-02-04 04:31:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-04 04:31:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 253 transitions. [2018-02-04 04:31:28,676 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 253 transitions. Word has length 139 [2018-02-04 04:31:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:28,677 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 253 transitions. [2018-02-04 04:31:28,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:31:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 253 transitions. [2018-02-04 04:31:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-04 04:31:28,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:28,679 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:31:28,679 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1055045868, 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:31:28,683 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:28,939 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:31:28,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:28,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:31:28,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:28,959 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:31:28,959 INFO L182 omatonBuilderFactory]: Interpolants [4392#true, 4393#false, 4522#(not (= 8 |zalloc_or_die_#in~size|)), 4523#(= (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)), 4532#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 4533#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4534#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 4535#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 4504#(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)|)), 4536#(= |#Ultimate.C_memset_#t~loopctr41| 2), 4505#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4537#(= 3 |#Ultimate.C_memset_#t~loopctr41|), 4506#(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))), 4538#(not (= 8 |#Ultimate.C_memset_#amount|))] [2018-02-04 04:31:28,959 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:31:28,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:31:28,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:31:28,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:31:28,960 INFO L87 Difference]: Start difference. First operand 235 states and 253 transitions. Second operand 14 states. [2018-02-04 04:31:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:29,904 INFO L93 Difference]: Finished difference Result 289 states and 313 transitions. [2018-02-04 04:31:29,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:31:29,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-02-04 04:31:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:29,905 INFO L225 Difference]: With dead ends: 289 [2018-02-04 04:31:29,905 INFO L226 Difference]: Without dead ends: 282 [2018-02-04 04:31:29,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:31:29,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-04 04:31:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 236. [2018-02-04 04:31:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 04:31:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 255 transitions. [2018-02-04 04:31:29,912 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 255 transitions. Word has length 144 [2018-02-04 04:31:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:29,912 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 255 transitions. [2018-02-04 04:31:29,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:31:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 255 transitions. [2018-02-04 04:31:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 04:31:29,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:29,913 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:31:29,913 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:29,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1760392426, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:31:29,921 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:30,235 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:31:30,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:30,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:31:30,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:30,252 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:31:30,252 INFO L182 omatonBuilderFactory]: Interpolants [5185#true, 5186#false, 5321#(not (= 8 |zalloc_or_die_#in~size|)), 5322#(= (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)), 5332#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 5333#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5302#(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)|)), 5334#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 5303#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5335#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 5304#(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))), 5336#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 5337#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 5338#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 5339#(not (= 8 |#Ultimate.C_memset_#amount|))] [2018-02-04 04:31:30,252 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:31:30,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:31:30,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:31:30,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:31:30,252 INFO L87 Difference]: Start difference. First operand 236 states and 255 transitions. Second operand 15 states. [2018-02-04 04:31:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:31,169 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2018-02-04 04:31:31,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:31:31,170 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 149 [2018-02-04 04:31:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:31,171 INFO L225 Difference]: With dead ends: 292 [2018-02-04 04:31:31,171 INFO L226 Difference]: Without dead ends: 285 [2018-02-04 04:31:31,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:31:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-02-04 04:31:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 237. [2018-02-04 04:31:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-04 04:31:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 257 transitions. [2018-02-04 04:31:31,177 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 257 transitions. Word has length 149 [2018-02-04 04:31:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:31,178 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 257 transitions. [2018-02-04 04:31:31,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:31:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 257 transitions. [2018-02-04 04:31:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 04:31:31,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:31,180 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:31:31,180 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1208459436, 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:31:31,185 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:31,463 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:31:31,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:31,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:31:31,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:31,479 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:31:31,479 INFO L182 omatonBuilderFactory]: Interpolants [6122#(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)|)), 6154#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 6123#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6155#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6124#(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))), 6156#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 6157#(<= |#Ultimate.C_memset_#t~loopctr41| 1), 6158#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 6159#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 6000#true, 6160#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 6001#false, 6161#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 6162#(not (= 8 |#Ultimate.C_memset_#amount|)), 6142#(not (= 8 |zalloc_or_die_#in~size|)), 6143#(= (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:31:31,480 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:31:31,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:31:31,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:31:31,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:31:31,480 INFO L87 Difference]: Start difference. First operand 237 states and 257 transitions. Second operand 16 states. [2018-02-04 04:31:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:32,427 INFO L93 Difference]: Finished difference Result 295 states and 321 transitions. [2018-02-04 04:31:32,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:31:32,427 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 154 [2018-02-04 04:31:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:32,428 INFO L225 Difference]: With dead ends: 295 [2018-02-04 04:31:32,428 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 04:31:32,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:31:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 04:31:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 238. [2018-02-04 04:31:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 04:31:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-02-04 04:31:32,433 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 154 [2018-02-04 04:31:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:32,434 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-02-04 04:31:32,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:31:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2018-02-04 04:31:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 04:31:32,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:32,435 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:31:32,435 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:32,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1211651926, 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) [2018-02-04 04:31:32,450 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:31:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:32,748 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:31:32,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:32,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:31:32,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:32,768 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:31:32,769 INFO L182 omatonBuilderFactory]: Interpolants [6985#(not (= 8 |zalloc_or_die_#in~size|)), 6986#(= (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)), 6964#(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)|)), 6837#true, 6965#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6838#false, 6966#(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))), 6998#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 6999#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7000#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 7001#(<= |#Ultimate.C_memset_#t~loopctr41| 1), 7002#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 7003#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 7004#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 7005#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 7006#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 7007#(not (= 8 |#Ultimate.C_memset_#amount|))] [2018-02-04 04:31:32,769 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:31:32,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:31:32,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:31:32,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:31:32,769 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand 17 states. [2018-02-04 04:31:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:33,806 INFO L93 Difference]: Finished difference Result 298 states and 325 transitions. [2018-02-04 04:31:33,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:31:33,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 159 [2018-02-04 04:31:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:33,807 INFO L225 Difference]: With dead ends: 298 [2018-02-04 04:31:33,808 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 04:31:33,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:31:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 04:31:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 239. [2018-02-04 04:31:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 04:31:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 261 transitions. [2018-02-04 04:31:33,814 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 261 transitions. Word has length 159 [2018-02-04 04:31:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:33,814 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 261 transitions. [2018-02-04 04:31:33,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:31:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 261 transitions. [2018-02-04 04:31:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-04 04:31:33,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:33,815 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:31:33,816 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash 994166676, 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:31:33,819 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:34,140 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:31:34,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:34,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:31:34,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:34,166 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:31:34,166 INFO L182 omatonBuilderFactory]: Interpolants [7872#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 7873#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 7874#(not (= 8 |#Ultimate.C_memset_#amount|)), 7850#(not (= 8 |zalloc_or_die_#in~size|)), 7851#(= (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)), 7696#true, 7697#false, 7828#(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)|)), 7829#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7830#(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))), 7864#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 7865#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7866#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 7867#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 7868#(= |#Ultimate.C_memset_#t~loopctr41| 2), 7869#(= |#Ultimate.C_memset_#t~loopctr41| 3), 7870#(= 4 |#Ultimate.C_memset_#t~loopctr41|), 7871#(<= |#Ultimate.C_memset_#t~loopctr41| 5)] [2018-02-04 04:31:34,166 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:31:34,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:31:34,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:31:34,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:31:34,167 INFO L87 Difference]: Start difference. First operand 239 states and 261 transitions. Second operand 18 states. [2018-02-04 04:31:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:35,343 INFO L93 Difference]: Finished difference Result 301 states and 329 transitions. [2018-02-04 04:31:35,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:31:35,344 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 164 [2018-02-04 04:31:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:35,345 INFO L225 Difference]: With dead ends: 301 [2018-02-04 04:31:35,345 INFO L226 Difference]: Without dead ends: 294 [2018-02-04 04:31:35,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:31:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-04 04:31:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 240. [2018-02-04 04:31:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-04 04:31:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 263 transitions. [2018-02-04 04:31:35,350 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 263 transitions. Word has length 164 [2018-02-04 04:31:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:35,350 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 263 transitions. [2018-02-04 04:31:35,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:31:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 263 transitions. [2018-02-04 04:31:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 04:31:35,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:35,351 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:31:35,351 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1661897834, 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:31:35,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,393 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:31:35,401 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:35,401 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:35,402 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:35,402 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:35,416 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:35,416 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:35,417 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:35,417 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:31:35,426 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 04:31:35,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:31:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:35,613 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:31:35,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:35,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 04:31:35,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:35,630 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:31:35,631 INFO L182 omatonBuilderFactory]: Interpolants [8720#(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)|)), 8577#true, 8721#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8578#false, 8755#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8714#(= |zalloc_or_die_#in~size| 119), 8715#(= 119 zalloc_or_die_~size), 8716#(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)), 8717#(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)), 8718#(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|)), 8719#(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))))] [2018-02-04 04:31:35,631 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:31:35,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:31:35,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:31:35,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=86, Unknown=2, NotChecked=0, Total=110 [2018-02-04 04:31:35,631 INFO L87 Difference]: Start difference. First operand 240 states and 263 transitions. Second operand 11 states. [2018-02-04 04:31:35,770 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:31:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:36,364 INFO L93 Difference]: Finished difference Result 271 states and 299 transitions. [2018-02-04 04:31:36,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:31:36,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2018-02-04 04:31:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:36,366 INFO L225 Difference]: With dead ends: 271 [2018-02-04 04:31:36,366 INFO L226 Difference]: Without dead ends: 271 [2018-02-04 04:31:36,367 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:31:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-04 04:31:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 239. [2018-02-04 04:31:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 04:31:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 262 transitions. [2018-02-04 04:31:36,372 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 262 transitions. Word has length 169 [2018-02-04 04:31:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:36,373 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 262 transitions. [2018-02-04 04:31:36,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:31:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 262 transitions. [2018-02-04 04:31:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 04:31:36,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:36,374 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:31:36,374 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash 255997988, 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:31:36,387 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:36,569 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:31:36,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:31:36,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:31:36,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:36,586 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:31:36,587 INFO L182 omatonBuilderFactory]: Interpolants [9408#true, 9744#(not (= 119 |zalloc_or_die_#in~size|)), 9409#false, 9745#(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)))), 9731#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 9751#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 9752#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 9753#(<= |#Ultimate.C_memset_#amount| 0), 9563#(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)|)), 9564#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9598#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:31:36,587 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:31:36,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:31:36,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:31:36,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:31:36,587 INFO L87 Difference]: Start difference. First operand 239 states and 262 transitions. Second operand 11 states. [2018-02-04 04:31:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:37,138 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2018-02-04 04:31:37,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:31:37,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 182 [2018-02-04 04:31:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:37,139 INFO L225 Difference]: With dead ends: 278 [2018-02-04 04:31:37,140 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 04:31:37,140 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:31:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 04:31:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2018-02-04 04:31:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 04:31:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 261 transitions. [2018-02-04 04:31:37,145 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 261 transitions. Word has length 182 [2018-02-04 04:31:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:37,145 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 261 transitions. [2018-02-04 04:31:37,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:31:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 261 transitions. [2018-02-04 04:31:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-04 04:31:37,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:37,146 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:31:37,146 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:37,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2048052318, 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:31:37,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:37,409 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:31:37,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:37,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:31:37,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:37,426 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:31:37,426 INFO L182 omatonBuilderFactory]: Interpolants [10643#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 10644#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 10453#(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)|)), 10645#(<= |#Ultimate.C_memset_#t~loopctr41| 1), 10454#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10646#(<= |#Ultimate.C_memset_#amount| 1), 10488#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10297#true, 10298#false, 10635#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 10636#(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))), 10621#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 04:31:37,427 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:31:37,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:31:37,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:31:37,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:31:37,427 INFO L87 Difference]: Start difference. First operand 239 states and 261 transitions. Second operand 12 states. [2018-02-04 04:31:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:38,125 INFO L93 Difference]: Finished difference Result 278 states and 304 transitions. [2018-02-04 04:31:38,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:31:38,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 183 [2018-02-04 04:31:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:38,127 INFO L225 Difference]: With dead ends: 278 [2018-02-04 04:31:38,127 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 04:31:38,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:31:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 04:31:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2018-02-04 04:31:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 04:31:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 260 transitions. [2018-02-04 04:31:38,131 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 260 transitions. Word has length 183 [2018-02-04 04:31:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:38,132 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 260 transitions. [2018-02-04 04:31:38,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:31:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 260 transitions. [2018-02-04 04:31:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 04:31:38,133 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:38,133 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:31:38,133 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:38,133 INFO L82 PathProgramCache]: Analyzing trace with hash -459167772, 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:31:38,138 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:38,341 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:31:38,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:38,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:31:38,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:38,359 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:31:38,359 INFO L182 omatonBuilderFactory]: Interpolants [11528#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 11529#(and (= |calloc_model_#in~size| calloc_model_~size) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 11345#(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)|)), 11537#(or (<= (mod |calloc_model_#in~size| 4294967296) 2) (not (= |calloc_model_#in~nmemb| 1)) (< 2147483647 (mod |calloc_model_#in~size| 4294967296))), 11346#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11538#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 11539#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 11188#true, 11380#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11540#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 11189#false, 11541#(<= |#Ultimate.C_memset_#amount| 2), 11513#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 04:31:38,359 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:31:38,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:31:38,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:31:38,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:31:38,360 INFO L87 Difference]: Start difference. First operand 239 states and 260 transitions. Second operand 13 states. [2018-02-04 04:31:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:38,985 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2018-02-04 04:31:38,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:31:38,986 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 184 [2018-02-04 04:31:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:38,987 INFO L225 Difference]: With dead ends: 278 [2018-02-04 04:31:38,987 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 04:31:38,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:31:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 04:31:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2018-02-04 04:31:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 04:31:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 259 transitions. [2018-02-04 04:31:38,992 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 259 transitions. Word has length 184 [2018-02-04 04:31:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:38,993 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 259 transitions. [2018-02-04 04:31:38,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:31:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2018-02-04 04:31:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 04:31:38,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:38,994 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:31:38,994 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:38,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1551612898, 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:31:38,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,198 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:31:39,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:39,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:31:39,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:39,215 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:31:39,215 INFO L182 omatonBuilderFactory]: Interpolants [12419#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 12420#(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)))), 12235#(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)|)), 12236#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12077#true, 12429#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 12078#false, 12270#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12430#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 12431#(<= |#Ultimate.C_memset_#t~loopctr41| 1), 12432#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 12433#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 12434#(<= |#Ultimate.C_memset_#amount| 3), 12403#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 04:31:39,215 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:31:39,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:31:39,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:31:39,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:31:39,216 INFO L87 Difference]: Start difference. First operand 239 states and 259 transitions. Second operand 14 states. [2018-02-04 04:31:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:39,852 INFO L93 Difference]: Finished difference Result 278 states and 302 transitions. [2018-02-04 04:31:39,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:31:39,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2018-02-04 04:31:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:39,853 INFO L225 Difference]: With dead ends: 278 [2018-02-04 04:31:39,853 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 04:31:39,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:31:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 04:31:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2018-02-04 04:31:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 04:31:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 258 transitions. [2018-02-04 04:31:39,856 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 258 transitions. Word has length 185 [2018-02-04 04:31:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:39,856 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 258 transitions. [2018-02-04 04:31:39,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:31:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 258 transitions. [2018-02-04 04:31:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-02-04 04:31:39,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:39,857 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:31:39,857 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash -538695772, 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:31:39,859 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:40,152 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:31:40,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:40,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:31:40,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:40,169 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:31:40,169 INFO L182 omatonBuilderFactory]: Interpolants [13320#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 13321#(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)))), 13135#(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)|)), 12976#true, 13136#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12977#false, 13170#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13331#(or (not (= |calloc_model_#in~nmemb| 1)) (<= (mod |calloc_model_#in~size| 4294967296) 4) (< 2147483647 (mod |calloc_model_#in~size| 4294967296))), 13332#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 13333#(and (<= |#Ultimate.C_memset_#t~loopctr41| 1) (< 0 |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr41|)), 13334#(and (<= |#Ultimate.C_memset_#t~loopctr41| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr41|) (< 0 |#Ultimate.C_memset_#amount|)), 13303#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 13335#(and (<= |#Ultimate.C_memset_#t~loopctr41| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr41|) (< 0 |#Ultimate.C_memset_#amount|)), 13336#(and (< 3 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr41| 4)), 13337#(and (<= |#Ultimate.C_memset_#amount| 4) (< 3 |#Ultimate.C_memset_#amount|))] [2018-02-04 04:31:40,169 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:31:40,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:31:40,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:31:40,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:31:40,170 INFO L87 Difference]: Start difference. First operand 239 states and 258 transitions. Second operand 15 states. [2018-02-04 04:31:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:41,053 INFO L93 Difference]: Finished difference Result 278 states and 301 transitions. [2018-02-04 04:31:41,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:31:41,053 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2018-02-04 04:31:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:41,054 INFO L225 Difference]: With dead ends: 278 [2018-02-04 04:31:41,054 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 04:31:41,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:31:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 04:31:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2018-02-04 04:31:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 04:31:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 257 transitions. [2018-02-04 04:31:41,080 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 257 transitions. Word has length 186 [2018-02-04 04:31:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:41,080 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 257 transitions. [2018-02-04 04:31:41,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:31:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 257 transitions. [2018-02-04 04:31:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 04:31:41,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:41,081 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:31:41,082 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:41,082 INFO L82 PathProgramCache]: Analyzing trace with hash -913755102, 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:31:41,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:41,391 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:31:41,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:41,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:31:41,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:41,409 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:31:41,409 INFO L182 omatonBuilderFactory]: Interpolants [14219#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 14220#(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))), 13873#true, 14033#(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)|)), 13874#false, 14034#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14068#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14231#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (< 2147483647 (mod |calloc_model_#in~size| 4294967296)) (<= (mod |calloc_model_#in~size| 4294967296) 5)), 14232#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 14201#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 14233#(<= |#Ultimate.C_memset_#t~loopctr41| 1), 14234#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 14235#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 14236#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 14237#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 14238#(<= |#Ultimate.C_memset_#amount| 5)] [2018-02-04 04:31:41,409 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:31:41,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:31:41,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:31:41,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:31:41,410 INFO L87 Difference]: Start difference. First operand 239 states and 257 transitions. Second operand 16 states. [2018-02-04 04:31:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:42,174 INFO L93 Difference]: Finished difference Result 278 states and 300 transitions. [2018-02-04 04:31:42,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:31:42,174 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 187 [2018-02-04 04:31:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:42,175 INFO L225 Difference]: With dead ends: 278 [2018-02-04 04:31:42,175 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 04:31:42,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:31:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 04:31:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2018-02-04 04:31:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 04:31:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 256 transitions. [2018-02-04 04:31:42,180 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 256 transitions. Word has length 187 [2018-02-04 04:31:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:42,180 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 256 transitions. [2018-02-04 04:31:42,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:31:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 256 transitions. [2018-02-04 04:31:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-04 04:31:42,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:42,181 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:31:42,181 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash 344307556, 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:31:42,183 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:42,480 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:31:42,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:42,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:31:42,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:42,497 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:31:42,498 INFO L182 omatonBuilderFactory]: Interpolants [15136#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 15137#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 15138#(= |#Ultimate.C_memset_#t~loopctr41| 2), 15139#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 15140#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 15141#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 15142#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 15143#(<= |#Ultimate.C_memset_#amount| 6), 15122#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 15123#(= (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)), 14774#true, 14775#false, 14935#(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)|)), 14936#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14970#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15103#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 15135#(or (<= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 6) (< 2147483647 (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296)))] [2018-02-04 04:31:42,498 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:31:42,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:31:42,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:31:42,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:31:42,499 INFO L87 Difference]: Start difference. First operand 239 states and 256 transitions. Second operand 17 states. [2018-02-04 04:31:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:43,419 INFO L93 Difference]: Finished difference Result 278 states and 299 transitions. [2018-02-04 04:31:43,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:31:43,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 188 [2018-02-04 04:31:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:43,420 INFO L225 Difference]: With dead ends: 278 [2018-02-04 04:31:43,420 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 04:31:43,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:31:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 04:31:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2018-02-04 04:31:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 04:31:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 255 transitions. [2018-02-04 04:31:43,423 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 255 transitions. Word has length 188 [2018-02-04 04:31:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:43,423 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 255 transitions. [2018-02-04 04:31:43,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:31:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 255 transitions. [2018-02-04 04:31:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 04:31:43,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:43,424 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:31:43,424 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash 689544290, 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:31:43,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:43,927 WARN L146 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:31:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:44,100 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:31:44,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:44,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:31:44,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:44,116 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:31:44,116 INFO L182 omatonBuilderFactory]: Interpolants [15680#false, 15841#(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)|)), 15842#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15876#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16009#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 16043#(or (not (= |calloc_model_#in~nmemb| 1)) (<= (mod |calloc_model_#in~size| 4294967296) 7) (< 2147483647 (mod |calloc_model_#in~size| 4294967296))), 16044#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 16045#(and (<= |#Ultimate.C_memset_#t~loopctr41| 1) (< 0 |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr41|)), 16046#(and (<= |#Ultimate.C_memset_#t~loopctr41| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr41|) (< 0 |#Ultimate.C_memset_#amount|)), 16047#(and (<= |#Ultimate.C_memset_#t~loopctr41| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr41|) (< 0 |#Ultimate.C_memset_#amount|)), 16048#(and (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr41| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr41|)), 16049#(and (<= 5 |#Ultimate.C_memset_#t~loopctr41|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr41| 5)), 16050#(and (<= |#Ultimate.C_memset_#t~loopctr41| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr41|) (< 0 |#Ultimate.C_memset_#amount|)), 16051#(and (<= |#Ultimate.C_memset_#t~loopctr41| 7) (< 6 |#Ultimate.C_memset_#amount|) (< 42949672953 (+ (* 4294967295 |#Ultimate.C_memset_#t~loopctr41|) (* 4294967296 |#Ultimate.C_memset_#amount|)))), 16052#(and (< 6 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 7) (< 42949672953 (+ (* 4294967295 |#Ultimate.C_memset_#t~loopctr41|) (* 4294967296 |#Ultimate.C_memset_#amount|)))), 16029#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 16030#(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)))), 15679#true] [2018-02-04 04:31:44,117 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:31:44,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:31:44,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:31:44,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:31:44,117 INFO L87 Difference]: Start difference. First operand 239 states and 255 transitions. Second operand 18 states. [2018-02-04 04:31:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:45,069 INFO L93 Difference]: Finished difference Result 276 states and 296 transitions. [2018-02-04 04:31:45,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:31:45,069 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 189 [2018-02-04 04:31:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:45,070 INFO L225 Difference]: With dead ends: 276 [2018-02-04 04:31:45,070 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 04:31:45,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:31:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 04:31:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 237. [2018-02-04 04:31:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-04 04:31:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 252 transitions. [2018-02-04 04:31:45,073 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 252 transitions. Word has length 189 [2018-02-04 04:31:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:45,074 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 252 transitions. [2018-02-04 04:31:45,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:31:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 252 transitions. [2018-02-04 04:31:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-04 04:31:45,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:45,074 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:31:45,074 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1493018844, 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:31:45,079 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:45,597 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:31:45,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:45,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 04:31:45,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:45,614 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:31:45,615 INFO L182 omatonBuilderFactory]: Interpolants [16960#(and (<= (+ |#Ultimate.C_memset_#t~loopctr41| 21474836465) (* 4294967295 |#Ultimate.C_memset_#amount|)) (< 0 |#Ultimate.C_memset_#amount|)), 16961#(and (< 0 |#Ultimate.C_memset_#amount|) (<= (+ |#Ultimate.C_memset_#amount| 21474836465) (* 4294967295 |#Ultimate.C_memset_#t~loopctr41|))), 16584#true, 16936#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 16585#false, 16937#(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)))), 16747#(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)|)), 16748#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16782#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16915#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 16951#(or (<= (mod |calloc_model_#in~size| 4294967296) 8) (not (= |calloc_model_#in~nmemb| 1)) (< 2147483647 (mod |calloc_model_#in~size| 4294967296))), 16952#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 16953#(and (= 1 |#Ultimate.C_memset_#t~loopctr41|) (< 0 |#Ultimate.C_memset_#amount|)), 16954#(and (<= |#Ultimate.C_memset_#t~loopctr41| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr41|) (< 0 |#Ultimate.C_memset_#amount|)), 16955#(and (<= |#Ultimate.C_memset_#t~loopctr41| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr41|) (< 0 |#Ultimate.C_memset_#amount|)), 16956#(and (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr41| 4)), 16957#(and (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr41| 5)), 16958#(and (<= |#Ultimate.C_memset_#t~loopctr41| 6) (< 0 |#Ultimate.C_memset_#amount|)), 16959#(and (<= |#Ultimate.C_memset_#t~loopctr41| 7) (< 0 |#Ultimate.C_memset_#amount|))] [2018-02-04 04:31:45,615 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:31:45,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:31:45,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:31:45,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:31:45,615 INFO L87 Difference]: Start difference. First operand 237 states and 252 transitions. Second operand 19 states. [2018-02-04 04:31:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:46,711 INFO L93 Difference]: Finished difference Result 280 states and 301 transitions. [2018-02-04 04:31:46,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:31:46,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2018-02-04 04:31:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:46,713 INFO L225 Difference]: With dead ends: 280 [2018-02-04 04:31:46,713 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 04:31:46,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:31:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 04:31:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 240. [2018-02-04 04:31:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-04 04:31:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 256 transitions. [2018-02-04 04:31:46,718 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 256 transitions. Word has length 190 [2018-02-04 04:31:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:46,718 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 256 transitions. [2018-02-04 04:31:46,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:31:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 256 transitions. [2018-02-04 04:31:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-04 04:31:46,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:46,719 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:31:46,719 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash -432999262, 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:31:46,725 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:47,125 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:31:47,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:47,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 04:31:47,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:47,141 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:31:47,142 INFO L182 omatonBuilderFactory]: Interpolants [17888#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 17889#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 17890#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 17891#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 17892#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 17893#(<= |#Ultimate.C_memset_#amount| 9), 17512#true, 17513#false, 17866#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 17867#(= (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)), 17676#(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)|)), 17677#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17711#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17844#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 17882#(or (<= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 9) (< 2147483647 (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296))), 17883#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 17884#(<= |#Ultimate.C_memset_#t~loopctr41| 1), 17885#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 17886#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 17887#(<= |#Ultimate.C_memset_#t~loopctr41| 4)] [2018-02-04 04:31:47,142 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:31:47,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:31:47,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:31:47,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:31:47,143 INFO L87 Difference]: Start difference. First operand 240 states and 256 transitions. Second operand 20 states. [2018-02-04 04:31:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:48,061 INFO L93 Difference]: Finished difference Result 283 states and 305 transitions. [2018-02-04 04:31:48,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:31:48,061 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 191 [2018-02-04 04:31:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:48,062 INFO L225 Difference]: With dead ends: 283 [2018-02-04 04:31:48,062 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 04:31:48,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:31:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 04:31:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 241. [2018-02-04 04:31:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-04 04:31:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 258 transitions. [2018-02-04 04:31:48,066 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 258 transitions. Word has length 191 [2018-02-04 04:31:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:48,067 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 258 transitions. [2018-02-04 04:31:48,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:31:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 258 transitions. [2018-02-04 04:31:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 04:31:48,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:48,068 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:31:48,068 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:48,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1932130588, 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:31:48,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:48,372 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:31:48,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:48,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 04:31:48,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:48,389 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:31:48,389 INFO L182 omatonBuilderFactory]: Interpolants [18816#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 18817#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 18818#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 18819#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 18820#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 18821#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 18438#true, 18822#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 18439#false, 18823#(<= |#Ultimate.C_memset_#amount| 10), 18794#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 18603#(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)|)), 18795#(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)))), 18604#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18638#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18771#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 18811#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 18812#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 18813#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 18814#(= |#Ultimate.C_memset_#t~loopctr41| 2), 18815#(= |#Ultimate.C_memset_#t~loopctr41| 3)] [2018-02-04 04:31:48,389 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:31:48,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:31:48,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:31:48,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:31:48,390 INFO L87 Difference]: Start difference. First operand 241 states and 258 transitions. Second operand 21 states. [2018-02-04 04:31:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:49,228 INFO L93 Difference]: Finished difference Result 283 states and 306 transitions. [2018-02-04 04:31:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 04:31:49,228 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2018-02-04 04:31:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:49,229 INFO L225 Difference]: With dead ends: 283 [2018-02-04 04:31:49,229 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 04:31:49,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:31:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 04:31:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 242. [2018-02-04 04:31:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 04:31:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 260 transitions. [2018-02-04 04:31:49,234 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 260 transitions. Word has length 192 [2018-02-04 04:31:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:49,234 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 260 transitions. [2018-02-04 04:31:49,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:31:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 260 transitions. [2018-02-04 04:31:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 04:31:49,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:49,235 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:31:49,236 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:49,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1160561438, 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:31:49,239 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:49,584 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:31:49,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:49,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 04:31:49,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:49,600 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:31:49,600 INFO L182 omatonBuilderFactory]: Interpolants [19753#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 19754#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 19755#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 19756#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 19757#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 19758#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 19759#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 19760#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 19377#true, 19761#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 19378#false, 19762#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 19763#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 19764#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 19765#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 19766#(<= |#Ultimate.C_memset_#amount| 11), 19543#(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)|)), 19735#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 19544#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19736#(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))), 19578#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19711#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 04:31:49,601 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:31:49,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:31:49,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:31:49,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:31:49,601 INFO L87 Difference]: Start difference. First operand 242 states and 260 transitions. Second operand 22 states. [2018-02-04 04:31:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:50,626 INFO L93 Difference]: Finished difference Result 286 states and 310 transitions. [2018-02-04 04:31:50,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:31:50,626 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2018-02-04 04:31:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:50,627 INFO L225 Difference]: With dead ends: 286 [2018-02-04 04:31:50,627 INFO L226 Difference]: Without dead ends: 279 [2018-02-04 04:31:50,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:31:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-04 04:31:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 243. [2018-02-04 04:31:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 04:31:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 262 transitions. [2018-02-04 04:31:50,631 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 262 transitions. Word has length 193 [2018-02-04 04:31:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:50,631 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 262 transitions. [2018-02-04 04:31:50,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:31:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 262 transitions. [2018-02-04 04:31:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-04 04:31:50,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:50,632 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:31:50,632 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1283245732, 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:31:50,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:51,030 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:31:51,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:51,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 04:31:51,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:51,046 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:31:51,046 INFO L182 omatonBuilderFactory]: Interpolants [20705#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 20706#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 20707#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 20708#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 20709#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 20326#true, 20710#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 20327#false, 20711#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 20712#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 20713#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 20714#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 20715#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 20716#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 20493#(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)|)), 20717#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 20494#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20718#(<= |#Ultimate.C_memset_#t~loopctr41| 12), 20686#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 20687#(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))), 20719#(<= |#Ultimate.C_memset_#amount| 12), 20528#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20661#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 04:31:51,046 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:31:51,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:31:51,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:31:51,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:31:51,047 INFO L87 Difference]: Start difference. First operand 243 states and 262 transitions. Second operand 23 states. [2018-02-04 04:31:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:52,385 INFO L93 Difference]: Finished difference Result 289 states and 314 transitions. [2018-02-04 04:31:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 04:31:52,418 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 194 [2018-02-04 04:31:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:52,420 INFO L225 Difference]: With dead ends: 289 [2018-02-04 04:31:52,420 INFO L226 Difference]: Without dead ends: 282 [2018-02-04 04:31:52,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:31:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-04 04:31:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 244. [2018-02-04 04:31:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 04:31:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-02-04 04:31:52,425 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 194 [2018-02-04 04:31:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:52,425 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-02-04 04:31:52,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:31:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-02-04 04:31:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-04 04:31:52,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:52,426 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:31:52,427 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:52,427 INFO L82 PathProgramCache]: Analyzing trace with hash -268143326, 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:31:52,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 695 proven. 91 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:31:52,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:52,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 04:31:52,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:52,868 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:31:52,868 INFO L182 omatonBuilderFactory]: Interpolants [21667#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 21668#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 21285#true, 21669#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 21286#false, 21670#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 21671#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 21672#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 21673#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 21674#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 21675#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 21676#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 21453#(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)|)), 21677#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 21454#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21678#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 21679#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 21647#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 21488#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21648#(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))), 21680#(<= |#Ultimate.C_memset_#t~loopctr41| 12), 21681#(<= |#Ultimate.C_memset_#t~loopctr41| 13), 21682#(<= |#Ultimate.C_memset_#amount| 13), 21621#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 04:31:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 695 proven. 91 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:31:52,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:31:52,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:31:52,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:31:52,868 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 24 states. [2018-02-04 04:31:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:54,357 INFO L93 Difference]: Finished difference Result 292 states and 318 transitions. [2018-02-04 04:31:54,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 04:31:54,357 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 195 [2018-02-04 04:31:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:54,358 INFO L225 Difference]: With dead ends: 292 [2018-02-04 04:31:54,358 INFO L226 Difference]: Without dead ends: 285 [2018-02-04 04:31:54,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=1364, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:31:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-02-04 04:31:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 245. [2018-02-04 04:31:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-04 04:31:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 266 transitions. [2018-02-04 04:31:54,362 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 266 transitions. Word has length 195 [2018-02-04 04:31:54,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:54,363 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 266 transitions. [2018-02-04 04:31:54,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:31:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 266 transitions. [2018-02-04 04:31:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-04 04:31:54,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:54,364 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:31:54,364 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:54,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1116563868, 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:31:54,366 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:54,730 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:31:54,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:54,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 04:31:54,746 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:54,746 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:31:54,746 INFO L182 omatonBuilderFactory]: Interpolants [22423#(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)|)), 22424#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22618#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 22619#(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))), 22254#true, 22255#false, 22639#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 22640#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 22641#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 22642#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 22643#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 22644#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 22645#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 22646#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 22647#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 22648#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 22649#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 22458#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22650#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 22651#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 22652#(<= |#Ultimate.C_memset_#t~loopctr41| 12), 22653#(<= |#Ultimate.C_memset_#t~loopctr41| 13), 22654#(<= |#Ultimate.C_memset_#t~loopctr41| 14), 22591#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 22655#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-04 04:31:54,747 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:31:54,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:31:54,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:31:54,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:31:54,747 INFO L87 Difference]: Start difference. First operand 245 states and 266 transitions. Second operand 25 states. [2018-02-04 04:31:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:57,295 INFO L93 Difference]: Finished difference Result 295 states and 322 transitions. [2018-02-04 04:31:57,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:31:57,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 196 [2018-02-04 04:31:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:57,296 INFO L225 Difference]: With dead ends: 295 [2018-02-04 04:31:57,296 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 04:31:57,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 04:31:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 04:31:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 246. [2018-02-04 04:31:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-04 04:31:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 268 transitions. [2018-02-04 04:31:57,299 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 268 transitions. Word has length 196 [2018-02-04 04:31:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:57,299 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 268 transitions. [2018-02-04 04:31:57,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:31:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 268 transitions. [2018-02-04 04:31:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 04:31:57,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:57,300 INFO L351 BasicCegarLoop]: trace histogram [55, 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:31:57,300 INFO L371 AbstractCegarLoop]: === Iteration 29 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:57,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1647796894, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:31:57,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2085 backedges. 785 proven. 120 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:31:57,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:57,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 04:31:57,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:57,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:31:57,778 INFO L182 omatonBuilderFactory]: Interpolants [23233#true, 23234#false, 23621#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 23622#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 23623#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 23624#(= |#Ultimate.C_memset_#t~loopctr41| 2), 23625#(= |#Ultimate.C_memset_#t~loopctr41| 3), 23626#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 23627#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 23628#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 23629#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 23438#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23630#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 23631#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 23632#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 23633#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 23634#(<= |#Ultimate.C_memset_#t~loopctr41| 12), 23571#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 23635#(<= |#Ultimate.C_memset_#t~loopctr41| 13), 23636#(<= |#Ultimate.C_memset_#t~loopctr41| 14), 23637#(<= |#Ultimate.C_memset_#t~loopctr41| 15), 23638#(<= |#Ultimate.C_memset_#amount| 15), 23403#(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)|)), 23404#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23599#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 23600#(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)))] [2018-02-04 04:31:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2085 backedges. 785 proven. 120 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:31:57,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:31:57,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:31:57,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:31:57,779 INFO L87 Difference]: Start difference. First operand 246 states and 268 transitions. Second operand 26 states. [2018-02-04 04:31:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:31:59,408 INFO L93 Difference]: Finished difference Result 298 states and 326 transitions. [2018-02-04 04:31:59,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 04:31:59,408 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 197 [2018-02-04 04:31:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:31:59,409 INFO L225 Difference]: With dead ends: 298 [2018-02-04 04:31:59,409 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 04:31:59,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=338, Invalid=1642, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:31:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 04:31:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 247. [2018-02-04 04:31:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 04:31:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 270 transitions. [2018-02-04 04:31:59,413 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 270 transitions. Word has length 197 [2018-02-04 04:31:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:31:59,414 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 270 transitions. [2018-02-04 04:31:59,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 04:31:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 270 transitions. [2018-02-04 04:31:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-04 04:31:59,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:31:59,415 INFO L351 BasicCegarLoop]: trace histogram [56, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:31:59,415 INFO L371 AbstractCegarLoop]: === Iteration 30 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:31:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash -936151516, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:31:59,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:31:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:31:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 830 proven. 136 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:31:59,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:31:59,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 04:31:59,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:31:59,863 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:31:59,863 INFO L182 omatonBuilderFactory]: Interpolants [24393#(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)|)), 24394#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24590#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 24591#(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))), 24222#true, 24223#false, 24613#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 24614#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 24615#(= |#Ultimate.C_memset_#t~loopctr41| 1), 24616#(= |#Ultimate.C_memset_#t~loopctr41| 2), 24617#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 24618#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 24619#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 24428#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24620#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 24621#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 24622#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 24623#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 24624#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 24561#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 24625#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 24626#(<= |#Ultimate.C_memset_#t~loopctr41| 12), 24627#(<= |#Ultimate.C_memset_#t~loopctr41| 13), 24628#(<= |#Ultimate.C_memset_#t~loopctr41| 14), 24629#(<= |#Ultimate.C_memset_#t~loopctr41| 15), 24630#(<= |#Ultimate.C_memset_#t~loopctr41| 16), 24631#(<= |#Ultimate.C_memset_#amount| 16)] [2018-02-04 04:31:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 830 proven. 136 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:31:59,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:31:59,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:31:59,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:31:59,864 INFO L87 Difference]: Start difference. First operand 247 states and 270 transitions. Second operand 27 states. [2018-02-04 04:32:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:32:01,375 INFO L93 Difference]: Finished difference Result 301 states and 330 transitions. [2018-02-04 04:32:01,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 04:32:01,375 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 198 [2018-02-04 04:32:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:32:01,376 INFO L225 Difference]: With dead ends: 301 [2018-02-04 04:32:01,377 INFO L226 Difference]: Without dead ends: 294 [2018-02-04 04:32:01,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1781, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:32:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-04 04:32:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 248. [2018-02-04 04:32:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 04:32:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2018-02-04 04:32:01,380 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 198 [2018-02-04 04:32:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:32:01,380 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2018-02-04 04:32:01,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:32:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2018-02-04 04:32:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-02-04 04:32:01,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:32:01,381 INFO L351 BasicCegarLoop]: trace histogram [57, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:32:01,381 INFO L371 AbstractCegarLoop]: === Iteration 31 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:32:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -349981278, now seen corresponding path program 18 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:32:01,400 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:32:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 875 proven. 153 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:32:02,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:32:02,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 04:32:02,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:32:02,003 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:32:02,003 INFO L182 omatonBuilderFactory]: Interpolants [25221#true, 25222#false, 25615#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 25616#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 25617#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 25618#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 25619#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 25428#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25620#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 25621#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 25622#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 25623#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 25624#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 25561#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 25625#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 25626#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 25627#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 25628#(<= |#Ultimate.C_memset_#t~loopctr41| 12), 25629#(<= |#Ultimate.C_memset_#t~loopctr41| 13), 25630#(<= |#Ultimate.C_memset_#t~loopctr41| 14), 25631#(<= |#Ultimate.C_memset_#t~loopctr41| 15), 25632#(<= |#Ultimate.C_memset_#t~loopctr41| 16), 25633#(<= |#Ultimate.C_memset_#t~loopctr41| 17), 25634#(<= |#Ultimate.C_memset_#amount| 17), 25393#(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)|)), 25394#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25591#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 25592#(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)))] [2018-02-04 04:32:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 875 proven. 153 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:32:02,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 04:32:02,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 04:32:02,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:32:02,004 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand 28 states. [2018-02-04 04:32:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:32:03,532 INFO L93 Difference]: Finished difference Result 304 states and 334 transitions. [2018-02-04 04:32:03,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 04:32:03,532 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 199 [2018-02-04 04:32:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:32:03,533 INFO L225 Difference]: With dead ends: 304 [2018-02-04 04:32:03,533 INFO L226 Difference]: Without dead ends: 297 [2018-02-04 04:32:03,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=426, Invalid=1926, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:32:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-02-04 04:32:03,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 249. [2018-02-04 04:32:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-04 04:32:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2018-02-04 04:32:03,537 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 199 [2018-02-04 04:32:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:32:03,537 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2018-02-04 04:32:03,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 04:32:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2018-02-04 04:32:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-02-04 04:32:03,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:32:03,538 INFO L351 BasicCegarLoop]: trace histogram [58, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:32:03,538 INFO L371 AbstractCegarLoop]: === Iteration 32 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:32:03,538 INFO L82 PathProgramCache]: Analyzing trace with hash 641426916, now seen corresponding path program 19 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:32:03,540 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:32:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 920 proven. 171 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:32:04,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:32:04,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 04:32:04,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:32:04,021 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:32:04,021 INFO L182 omatonBuilderFactory]: Interpolants [26627#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 26628#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 26629#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 26438#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26630#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 26631#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 26632#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 26633#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 26634#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 26571#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 26635#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 26636#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 26637#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 26638#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 26639#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 26640#(<= |#Ultimate.C_memset_#t~loopctr41| 12), 26641#(<= |#Ultimate.C_memset_#t~loopctr41| 13), 26642#(<= |#Ultimate.C_memset_#t~loopctr41| 14), 26643#(<= |#Ultimate.C_memset_#t~loopctr41| 15), 26644#(<= |#Ultimate.C_memset_#t~loopctr41| 16), 26645#(<= |#Ultimate.C_memset_#t~loopctr41| 17), 26646#(<= |#Ultimate.C_memset_#t~loopctr41| 18), 26647#(<= |#Ultimate.C_memset_#amount| 18), 26403#(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)|)), 26404#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26602#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 26603#(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))), 26230#true, 26231#false] [2018-02-04 04:32:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 920 proven. 171 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:32:04,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:32:04,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:32:04,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:32:04,022 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand 29 states. [2018-02-04 04:32:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:32:05,514 INFO L93 Difference]: Finished difference Result 307 states and 338 transitions. [2018-02-04 04:32:05,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 04:32:05,514 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 200 [2018-02-04 04:32:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:32:05,515 INFO L225 Difference]: With dead ends: 307 [2018-02-04 04:32:05,515 INFO L226 Difference]: Without dead ends: 300 [2018-02-04 04:32:05,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=471, Invalid=2079, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:32:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-04 04:32:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 250. [2018-02-04 04:32:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-04 04:32:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 276 transitions. [2018-02-04 04:32:05,518 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 276 transitions. Word has length 200 [2018-02-04 04:32:05,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:32:05,518 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 276 transitions. [2018-02-04 04:32:05,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:32:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 276 transitions. [2018-02-04 04:32:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 04:32:05,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:32:05,518 INFO L351 BasicCegarLoop]: trace histogram [59, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:32:05,519 INFO L371 AbstractCegarLoop]: === Iteration 33 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:32:05,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1310309858, now seen corresponding path program 20 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:32:05,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:32:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 965 proven. 190 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:32:06,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:32:06,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 04:32:06,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:32:06,039 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:32:06,040 INFO L182 omatonBuilderFactory]: Interpolants [27649#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 27458#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27650#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 27651#(<= |#Ultimate.C_memset_#t~loopctr41| 1), 27652#(<= |#Ultimate.C_memset_#t~loopctr41| 2), 27653#(<= |#Ultimate.C_memset_#t~loopctr41| 3), 27654#(<= |#Ultimate.C_memset_#t~loopctr41| 4), 27591#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 27655#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 27656#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 27657#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 27658#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 27659#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 27660#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 27661#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 27662#(<= |#Ultimate.C_memset_#t~loopctr41| 12), 27663#(<= |#Ultimate.C_memset_#t~loopctr41| 13), 27664#(<= |#Ultimate.C_memset_#t~loopctr41| 14), 27665#(<= |#Ultimate.C_memset_#t~loopctr41| 15), 27666#(<= |#Ultimate.C_memset_#t~loopctr41| 16), 27667#(<= |#Ultimate.C_memset_#t~loopctr41| 17), 27668#(<= |#Ultimate.C_memset_#t~loopctr41| 18), 27669#(<= |#Ultimate.C_memset_#t~loopctr41| 19), 27670#(<= |#Ultimate.C_memset_#amount| 19), 27423#(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)|)), 27424#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27623#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 27624#(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))), 27249#true, 27250#false] [2018-02-04 04:32:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 965 proven. 190 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:32:06,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 04:32:06,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 04:32:06,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:32:06,040 INFO L87 Difference]: Start difference. First operand 250 states and 276 transitions. Second operand 30 states. [2018-02-04 04:32:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:32:08,048 INFO L93 Difference]: Finished difference Result 310 states and 342 transitions. [2018-02-04 04:32:08,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 04:32:08,049 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 201 [2018-02-04 04:32:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:32:08,050 INFO L225 Difference]: With dead ends: 310 [2018-02-04 04:32:08,050 INFO L226 Difference]: Without dead ends: 303 [2018-02-04 04:32:08,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=521, Invalid=2235, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:32:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-04 04:32:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 251. [2018-02-04 04:32:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 04:32:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 278 transitions. [2018-02-04 04:32:08,054 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 278 transitions. Word has length 201 [2018-02-04 04:32:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:32:08,054 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 278 transitions. [2018-02-04 04:32:08,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 04:32:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 278 transitions. [2018-02-04 04:32:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 04:32:08,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:32:08,055 INFO L351 BasicCegarLoop]: trace histogram [60, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:32:08,056 INFO L371 AbstractCegarLoop]: === Iteration 34 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:32:08,056 INFO L82 PathProgramCache]: Analyzing trace with hash 570844580, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:32:08,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:32:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 1010 proven. 210 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:32:08,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:32:08,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 04:32:08,592 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:32:08,592 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:32:08,592 INFO L182 omatonBuilderFactory]: Interpolants [28488#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28681#(or (<= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 20) (< 2147483647 (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296))), 28682#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 28683#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 28684#(= |#Ultimate.C_memset_#t~loopctr41| 2), 28621#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 28685#(= |#Ultimate.C_memset_#t~loopctr41| 3), 28686#(= 4 |#Ultimate.C_memset_#t~loopctr41|), 28687#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 28688#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 28689#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 28690#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 28691#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 28692#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 28693#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 28694#(<= |#Ultimate.C_memset_#t~loopctr41| 12), 28695#(<= |#Ultimate.C_memset_#t~loopctr41| 13), 28696#(<= |#Ultimate.C_memset_#t~loopctr41| 14), 28697#(<= |#Ultimate.C_memset_#t~loopctr41| 15), 28698#(<= |#Ultimate.C_memset_#t~loopctr41| 16), 28699#(<= |#Ultimate.C_memset_#t~loopctr41| 17), 28700#(<= |#Ultimate.C_memset_#t~loopctr41| 18), 28701#(<= |#Ultimate.C_memset_#t~loopctr41| 19), 28702#(<= |#Ultimate.C_memset_#t~loopctr41| 20), 28703#(<= |#Ultimate.C_memset_#amount| 20), 28453#(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)|)), 28454#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28654#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 28655#(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))), 28278#true, 28279#false] [2018-02-04 04:32:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 1010 proven. 210 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:32:08,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 04:32:08,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 04:32:08,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:32:08,593 INFO L87 Difference]: Start difference. First operand 251 states and 278 transitions. Second operand 31 states. [2018-02-04 04:32:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:32:10,032 INFO L93 Difference]: Finished difference Result 316 states and 349 transitions. [2018-02-04 04:32:10,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 04:32:10,032 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 202 [2018-02-04 04:32:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:32:10,033 INFO L225 Difference]: With dead ends: 316 [2018-02-04 04:32:10,033 INFO L226 Difference]: Without dead ends: 309 [2018-02-04 04:32:10,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=533, Invalid=2119, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 04:32:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-04 04:32:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 252. [2018-02-04 04:32:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-04 04:32:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 280 transitions. [2018-02-04 04:32:10,036 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 280 transitions. Word has length 202 [2018-02-04 04:32:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:32:10,036 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 280 transitions. [2018-02-04 04:32:10,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 04:32:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 280 transitions. [2018-02-04 04:32:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-02-04 04:32:10,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:32:10,037 INFO L351 BasicCegarLoop]: trace histogram [61, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:32:10,037 INFO L371 AbstractCegarLoop]: === Iteration 35 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:32:10,037 INFO L82 PathProgramCache]: Analyzing trace with hash -877742558, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:32:10,039 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:32:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 1055 proven. 231 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:32:10,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:32:10,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 04:32:10,566 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:32:10,566 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:32:10,566 INFO L182 omatonBuilderFactory]: Interpolants [29314#true, 29315#false, 29525#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29720#(or (< 2147483647 (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296)) (<= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 21)), 29721#(= 0 |#Ultimate.C_memset_#t~loopctr41|), 29658#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 29722#(= 1 |#Ultimate.C_memset_#t~loopctr41|), 29723#(= |#Ultimate.C_memset_#t~loopctr41| 2), 29724#(= |#Ultimate.C_memset_#t~loopctr41| 3), 29725#(= 4 |#Ultimate.C_memset_#t~loopctr41|), 29726#(<= |#Ultimate.C_memset_#t~loopctr41| 5), 29727#(<= |#Ultimate.C_memset_#t~loopctr41| 6), 29728#(<= |#Ultimate.C_memset_#t~loopctr41| 7), 29729#(<= |#Ultimate.C_memset_#t~loopctr41| 8), 29730#(<= |#Ultimate.C_memset_#t~loopctr41| 9), 29731#(<= |#Ultimate.C_memset_#t~loopctr41| 10), 29732#(<= |#Ultimate.C_memset_#t~loopctr41| 11), 29733#(<= |#Ultimate.C_memset_#t~loopctr41| 12), 29734#(<= |#Ultimate.C_memset_#t~loopctr41| 13), 29735#(<= |#Ultimate.C_memset_#t~loopctr41| 14), 29736#(<= |#Ultimate.C_memset_#t~loopctr41| 15), 29737#(<= |#Ultimate.C_memset_#t~loopctr41| 16), 29738#(<= |#Ultimate.C_memset_#t~loopctr41| 17), 29739#(<= |#Ultimate.C_memset_#t~loopctr41| 18), 29740#(<= |#Ultimate.C_memset_#t~loopctr41| 19), 29741#(<= |#Ultimate.C_memset_#t~loopctr41| 20), 29742#(<= |#Ultimate.C_memset_#t~loopctr41| 21), 29743#(<= |#Ultimate.C_memset_#amount| 21), 29490#(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)|)), 29491#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29692#(not (= 119 (mod |zalloc_or_die_#in~size| 4294967296))), 29693#(= (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:32:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 1055 proven. 231 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 04:32:10,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 04:32:10,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 04:32:10,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:32:10,567 INFO L87 Difference]: Start difference. First operand 252 states and 280 transitions. Second operand 32 states. [2018-02-04 04:32:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:32:11,932 INFO L93 Difference]: Finished difference Result 319 states and 353 transitions. [2018-02-04 04:32:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 04:32:11,932 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 203 [2018-02-04 04:32:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:32:11,933 INFO L225 Difference]: With dead ends: 319 [2018-02-04 04:32:11,933 INFO L226 Difference]: Without dead ends: 312 [2018-02-04 04:32:11,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=587, Invalid=2275, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:32:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-02-04 04:32:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 253. [2018-02-04 04:32:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-04 04:32:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 282 transitions. [2018-02-04 04:32:11,937 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 282 transitions. Word has length 203 [2018-02-04 04:32:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:32:11,937 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 282 transitions. [2018-02-04 04:32:11,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 04:32:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 282 transitions. [2018-02-04 04:32:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-02-04 04:32:11,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:32:11,938 INFO L351 BasicCegarLoop]: trace histogram [62, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:32:11,938 INFO L371 AbstractCegarLoop]: === Iteration 36 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, 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:32:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1460696420, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:32:11,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:32:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:12,855 WARN L146 SmtUtils]: Spent 708ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:32:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:32:15,123 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseInterpolants(Executor.java:255) at de.uni_freiburg.informatik.ultimate.smtsolver.external.ScriptorWithGetInterpolants.readInterpolants(ScriptorWithGetInterpolants.java:136) at de.uni_freiburg.informatik.ultimate.smtsolver.external.ScriptorWithGetInterpolants.getInterpolants(ScriptorWithGetInterpolants.java:64) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.getInterpolants(DiffWrapperScript.java:260) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:196) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:347) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:196) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:347) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:196) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:347) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:196) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 43 more [2018-02-04 04:32:15,125 INFO L168 Benchmark]: Toolchain (without parser) took 53149.77 ms. Allocated memory was 390.6 MB in the beginning and 1.2 GB in the end (delta: 774.9 MB). Free memory was 347.3 MB in the beginning and 1.1 GB in the end (delta: -737.2 MB). Peak memory consumption was 37.7 MB. Max. memory is 5.3 GB. [2018-02-04 04:32:15,126 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 390.6 MB. Free memory is still 353.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:32:15,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.13 ms. Allocated memory is still 390.6 MB. Free memory was 347.3 MB in the beginning and 335.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:32:15,126 INFO L168 Benchmark]: Boogie Preprocessor took 37.56 ms. Allocated memory is still 390.6 MB. Free memory was 335.4 MB in the beginning and 332.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:32:15,126 INFO L168 Benchmark]: RCFGBuilder took 492.43 ms. Allocated memory is still 390.6 MB. Free memory was 332.7 MB in the beginning and 281.0 MB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 5.3 GB. [2018-02-04 04:32:15,127 INFO L168 Benchmark]: TraceAbstraction took 52420.92 ms. Allocated memory was 390.6 MB in the beginning and 1.2 GB in the end (delta: 774.9 MB). Free memory was 281.0 MB in the beginning and 1.1 GB in the end (delta: -803.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:32:15,128 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 390.6 MB. Free memory is still 353.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 196.13 ms. Allocated memory is still 390.6 MB. Free memory was 347.3 MB in the beginning and 335.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.56 ms. Allocated memory is still 390.6 MB. Free memory was 335.4 MB in the beginning and 332.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 492.43 ms. Allocated memory is still 390.6 MB. Free memory was 332.7 MB in the beginning and 281.0 MB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52420.92 ms. Allocated memory was 390.6 MB in the beginning and 1.2 GB in the end (delta: 774.9 MB). Free memory was 281.0 MB in the beginning and 1.1 GB in the end (delta: -803.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-32-15-133.csv Received shutdown request...