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-0236_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:36:01,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:36:01,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:36:01,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:36:01,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:36:01,908 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:36:01,909 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:36:01,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:36:01,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:36:01,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:36:01,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:36:01,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:36:01,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:36:01,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:36:01,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:36:01,918 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:36:01,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:36:01,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:36:01,922 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:36:01,923 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:36:01,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:36:01,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:36:01,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:36:01,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:36:01,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:36:01,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:36:01,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:36:01,928 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:36:01,928 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:36:01,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:36:01,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:36:01,929 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:36:01,939 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:36:01,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:36:01,940 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:36:01,940 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:36:01,940 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:36:01,941 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:36:01,941 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:36:01,941 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:36:01,941 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:36:01,942 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:36:01,942 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:36:01,942 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:36:01,942 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:36:01,942 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:36:01,942 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:36:01,942 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:36:01,943 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:36:01,943 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:36:01,943 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:36:01,943 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:36:01,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:36:01,943 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:36:01,944 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 04:36:01,944 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 04:36:01,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:01,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:36:01,983 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:36:01,986 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:36:01,987 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:36:01,988 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:36:01,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0236_true-valid-memsafety.i [2018-02-04 04:36:02,144 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:36:02,145 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:36:02,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:36:02,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:36:02,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:36:02,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:02,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263e0bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02, skipping insertion in model container [2018-02-04 04:36:02,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:02,161 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:36:02,196 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:36:02,301 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:36:02,323 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:36:02,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02 WrapperNode [2018-02-04 04:36:02,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:36:02,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:36:02,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:36:02,333 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:36:02,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:02,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:02,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:02,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:02,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:02,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:02,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:02,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:36:02,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:36:02,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:36:02,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:36:02,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02" (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:36:02,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:36:02,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:36:02,409 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 04:36:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 04:36:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 04:36:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 04:36:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 04:36:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 04:36:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 04:36:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 04:36:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 04:36:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 04:36:02,410 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 04:36:02,411 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 04:36:02,411 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:36:02,411 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:36:02,411 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:36:02,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:36:02,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:36:02,411 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:36:02,411 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 04:36:02,411 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 04:36:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:36:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:36:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 04:36:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 04:36:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 04:36:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:36:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 04:36:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 04:36:02,412 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 04:36:02,413 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 04:36:02,413 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 04:36:02,413 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 04:36:02,413 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 04:36:02,413 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 04:36:02,413 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 04:36:02,413 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 04:36:02,413 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 04:36:02,413 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:36:02,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:36:02,414 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:36:02,792 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 04:36:03,296 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:36:03,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:36:03 BoogieIcfgContainer [2018-02-04 04:36:03,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:36:03,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:36:03,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:36:03,299 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:36:03,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:36:02" (1/3) ... [2018-02-04 04:36:03,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e51283f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:36:03, skipping insertion in model container [2018-02-04 04:36:03,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:02" (2/3) ... [2018-02-04 04:36:03,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e51283f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:36:03, skipping insertion in model container [2018-02-04 04:36:03,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:36:03" (3/3) ... [2018-02-04 04:36:03,302 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0236_true-valid-memsafety.i [2018-02-04 04:36:03,307 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:36:03,313 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2018-02-04 04:36:03,343 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:36:03,343 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:36:03,343 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 04:36:03,344 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 04:36:03,344 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:36:03,344 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:36:03,344 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:36:03,344 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:36:03,345 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:36:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states. [2018-02-04 04:36:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:36:03,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:03,382 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:36:03,382 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:03,386 INFO L82 PathProgramCache]: Analyzing trace with hash 12769440, 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:36:03,396 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:03,438 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:36:03,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:03,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:36:03,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:03,460 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:36:03,460 INFO L182 omatonBuilderFactory]: Interpolants [256#true, 257#false, 258#(= 1 (select |#valid| |~#list~0.base|))] [2018-02-04 04:36:03,461 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:36:03,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:36:03,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:36:03,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:36:03,473 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 3 states. [2018-02-04 04:36:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:03,700 INFO L93 Difference]: Finished difference Result 282 states and 301 transitions. [2018-02-04 04:36:03,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:36:03,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 04:36:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:03,716 INFO L225 Difference]: With dead ends: 282 [2018-02-04 04:36:03,716 INFO L226 Difference]: Without dead ends: 279 [2018-02-04 04:36:03,718 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:36:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-04 04:36:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 248. [2018-02-04 04:36:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 04:36:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 263 transitions. [2018-02-04 04:36:03,880 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 263 transitions. Word has length 4 [2018-02-04 04:36:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:03,881 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 263 transitions. [2018-02-04 04:36:03,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:36:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 263 transitions. [2018-02-04 04:36:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:36:03,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:03,881 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:36:03,882 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:03,882 INFO L82 PathProgramCache]: Analyzing trace with hash 12769441, 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:36:03,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:03,896 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:36:03,900 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:03,900 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:03,901 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:03,901 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:03,929 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:36:03,957 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:36:03,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:03,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:36:03,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:03,985 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:36:03,986 INFO L182 omatonBuilderFactory]: Interpolants [789#true, 790#false, 791#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 792#(and (<= (+ |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (= 4 (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))] [2018-02-04 04:36:03,986 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:36:03,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:36:03,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:36:03,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:36:03,988 INFO L87 Difference]: Start difference. First operand 248 states and 263 transitions. Second operand 4 states. [2018-02-04 04:36:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:04,108 INFO L93 Difference]: Finished difference Result 255 states and 273 transitions. [2018-02-04 04:36:04,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:36:04,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 04:36:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:04,111 INFO L225 Difference]: With dead ends: 255 [2018-02-04 04:36:04,111 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 04:36:04,112 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:36:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 04:36:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 247. [2018-02-04 04:36:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 04:36:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 262 transitions. [2018-02-04 04:36:04,125 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 262 transitions. Word has length 4 [2018-02-04 04:36:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:04,125 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 262 transitions. [2018-02-04 04:36:04,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:36:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 262 transitions. [2018-02-04 04:36:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:36:04,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:04,126 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:36:04,126 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1129613849, 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) [2018-02-04 04:36:04,130 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:04,144 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:36:04,156 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,156 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,156 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,157 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,203 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:36:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:04,300 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:36:04,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:04,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:36:04,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:04,331 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:36:04,332 INFO L182 omatonBuilderFactory]: Interpolants [1296#false, 1302#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 1303#(= 1 (select |#valid| |calloc_model_#t~malloc0.base|)), 1304#(= 1 (select |#valid| calloc_model_~ptr~0.base)), 1305#(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)|)), 1295#true] [2018-02-04 04:36:04,332 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:36:04,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:36:04,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:36:04,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-02-04 04:36:04,333 INFO L87 Difference]: Start difference. First operand 247 states and 262 transitions. Second operand 6 states. [2018-02-04 04:36:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:04,868 INFO L93 Difference]: Finished difference Result 278 states and 299 transitions. [2018-02-04 04:36:04,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:36:04,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 04:36:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:04,873 INFO L225 Difference]: With dead ends: 278 [2018-02-04 04:36:04,873 INFO L226 Difference]: Without dead ends: 278 [2018-02-04 04:36:04,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=28, Unknown=2, NotChecked=10, Total=56 [2018-02-04 04:36:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-04 04:36:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 246. [2018-02-04 04:36:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-04 04:36:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 261 transitions. [2018-02-04 04:36:04,893 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 261 transitions. Word has length 17 [2018-02-04 04:36:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:04,893 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 261 transitions. [2018-02-04 04:36:04,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:36:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 261 transitions. [2018-02-04 04:36:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:36:04,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:04,894 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:36:04,894 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1129613850, 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:36:04,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:04,919 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 04:36:04,975 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,975 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,976 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,976 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,989 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,990 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,990 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,991 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:05,114 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:36:05,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:05,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:36:05,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:05,145 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:36:05,145 INFO L182 omatonBuilderFactory]: Interpolants [1841#(= |zalloc_or_die_#in~size| 12), 1842#(= 12 zalloc_or_die_~size), 1843#(exists ((%0 (Array Int Int))) (! (and (= |calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 12) (store |#length| %1 12)) :qid itp)) (= |calloc_model_#in~size| 12)) :qid itp)), 1844#(exists ((%0 (Array Int Int))) (! (and (= (ite (<= (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) 2147483647) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (+ (- 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))) 12) (forall ((%1 Int)) (! (= (store %0 %1 12) (store |#length| %1 12)) :qid itp))) :qid itp)), 1845#(and (= 12 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (= 0 |calloc_model_#t~malloc0.offset|) (= 12 (select |#length| |calloc_model_#t~malloc0.base|))), 1846#(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)))), 1847#(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)|)), 1834#true, 1835#false] [2018-02-04 04:36:05,146 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:36:05,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:36:05,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:36:05,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=55, Unknown=2, NotChecked=0, Total=72 [2018-02-04 04:36:05,146 INFO L87 Difference]: Start difference. First operand 246 states and 261 transitions. Second operand 9 states. [2018-02-04 04:36:05,236 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_~#list~0.base| |c_old(~#list~0.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_~#list~0.offset| |c_old(~#list~0.offset)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (exists ((%0 (Array Int Int))) (! (and (= |c_calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 12) (store |c_#length| %1 12)) :qid itp)) (= |c_calloc_model_#in~size| 12)) :qid itp)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2018-02-04 04:36:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:05,866 INFO L93 Difference]: Finished difference Result 291 states and 313 transitions. [2018-02-04 04:36:05,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:36:05,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 04:36:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:05,872 INFO L225 Difference]: With dead ends: 291 [2018-02-04 04:36:05,873 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 04:36:05,874 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=120, Unknown=4, NotChecked=22, Total=182 [2018-02-04 04:36:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 04:36:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 259. [2018-02-04 04:36:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-04 04:36:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 274 transitions. [2018-02-04 04:36:05,883 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 274 transitions. Word has length 17 [2018-02-04 04:36:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:05,883 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 274 transitions. [2018-02-04 04:36:05,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:36:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 274 transitions. [2018-02-04 04:36:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 04:36:05,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:05,886 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:36:05,887 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1796966759, 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:36:05,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,179 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:36:06,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:06,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:36:06,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:06,200 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:36:06,200 INFO L182 omatonBuilderFactory]: Interpolants [2576#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 2596#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 2597#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 2598#(<= |#Ultimate.C_memset_#amount| 0), 2408#true, 2409#false, 2505#(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)|)), 2506#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2524#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2589#(not (= 12 |zalloc_or_die_#in~size|)), 2590#(= (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:36:06,200 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:36:06,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:36:06,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:36:06,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:36:06,200 INFO L87 Difference]: Start difference. First operand 259 states and 274 transitions. Second operand 11 states. [2018-02-04 04:36:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:07,289 INFO L93 Difference]: Finished difference Result 305 states and 326 transitions. [2018-02-04 04:36:07,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:36:07,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-02-04 04:36:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:07,291 INFO L225 Difference]: With dead ends: 305 [2018-02-04 04:36:07,291 INFO L226 Difference]: Without dead ends: 298 [2018-02-04 04:36:07,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:36:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-04 04:36:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 262. [2018-02-04 04:36:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-02-04 04:36:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 278 transitions. [2018-02-04 04:36:07,300 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 278 transitions. Word has length 129 [2018-02-04 04:36:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:07,300 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 278 transitions. [2018-02-04 04:36:07,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:36:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 278 transitions. [2018-02-04 04:36:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 04:36:07,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:07,302 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:36:07,302 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1396912135, 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:36:07,306 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,649 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:36:07,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:07,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:36:07,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:07,680 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:36:07,681 INFO L182 omatonBuilderFactory]: Interpolants [3313#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 3314#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3187#true, 3315#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 3188#false, 3316#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 1)) (and (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|))), 3317#(<= |#Ultimate.C_memset_#amount| 1), 3289#(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)|)), 3305#(not (= 12 |zalloc_or_die_#in~size|)), 3290#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3306#(= (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)), 3291#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12))))] [2018-02-04 04:36:07,681 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:36:07,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:36:07,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:36:07,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:36:07,682 INFO L87 Difference]: Start difference. First operand 262 states and 278 transitions. Second operand 12 states. [2018-02-04 04:36:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:08,529 INFO L93 Difference]: Finished difference Result 311 states and 333 transitions. [2018-02-04 04:36:08,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:36:08,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2018-02-04 04:36:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:08,530 INFO L225 Difference]: With dead ends: 311 [2018-02-04 04:36:08,531 INFO L226 Difference]: Without dead ends: 304 [2018-02-04 04:36:08,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:36:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-04 04:36:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 263. [2018-02-04 04:36:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 04:36:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 280 transitions. [2018-02-04 04:36:08,539 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 280 transitions. Word has length 134 [2018-02-04 04:36:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:08,540 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 280 transitions. [2018-02-04 04:36:08,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:36:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 280 transitions. [2018-02-04 04:36:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 04:36:08,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:08,541 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:36:08,542 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:08,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1210904985, 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:36:08,546 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,785 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:36:08,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:08,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:36:08,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:08,802 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:36:08,803 INFO L182 omatonBuilderFactory]: Interpolants [4128#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 4129#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 4130#(or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 2))), 4131#(<= |#Ultimate.C_memset_#amount| 2), 4100#(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)|)), 4101#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4102#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 4117#(not (= 12 |zalloc_or_die_#in~size|)), 4118#(= (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)), 3993#true, 3994#false, 4126#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 4127#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:36:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 30 proven. 91 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 04:36:08,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:36:08,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:36:08,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:36:08,804 INFO L87 Difference]: Start difference. First operand 263 states and 280 transitions. Second operand 13 states. [2018-02-04 04:36:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:09,773 INFO L93 Difference]: Finished difference Result 314 states and 337 transitions. [2018-02-04 04:36:09,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:36:09,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2018-02-04 04:36:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:09,775 INFO L225 Difference]: With dead ends: 314 [2018-02-04 04:36:09,775 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 04:36:09,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:36:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 04:36:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 264. [2018-02-04 04:36:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 04:36:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 282 transitions. [2018-02-04 04:36:09,782 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 282 transitions. Word has length 139 [2018-02-04 04:36:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:09,782 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 282 transitions. [2018-02-04 04:36:09,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:36:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 282 transitions. [2018-02-04 04:36:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-04 04:36:09,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:09,784 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:36:09,784 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:09,784 INFO L82 PathProgramCache]: Analyzing trace with hash 976007175, 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:36:09,792 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:10,031 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:36:10,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:10,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:36:10,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:10,049 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:36:10,049 INFO L182 omatonBuilderFactory]: Interpolants [4961#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 4962#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4963#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 4964#(<= |#Ultimate.C_memset_#t~loopctr49| 1), 4933#(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)|)), 4965#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 4934#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4966#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 4935#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 4967#(not (= 12 |#Ultimate.C_memset_#amount|)), 4821#true, 4822#false, 4951#(not (= 12 |zalloc_or_die_#in~size|)), 4952#(= (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:36:10,049 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:36:10,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:36:10,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:36:10,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:36:10,050 INFO L87 Difference]: Start difference. First operand 264 states and 282 transitions. Second operand 14 states. [2018-02-04 04:36:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:10,914 INFO L93 Difference]: Finished difference Result 317 states and 341 transitions. [2018-02-04 04:36:10,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:36:10,940 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-02-04 04:36:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:10,941 INFO L225 Difference]: With dead ends: 317 [2018-02-04 04:36:10,941 INFO L226 Difference]: Without dead ends: 310 [2018-02-04 04:36:10,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:36:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-02-04 04:36:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 265. [2018-02-04 04:36:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 04:36:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 284 transitions. [2018-02-04 04:36:10,947 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 284 transitions. Word has length 144 [2018-02-04 04:36:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:10,947 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 284 transitions. [2018-02-04 04:36:10,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:36:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 284 transitions. [2018-02-04 04:36:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 04:36:10,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:10,949 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:36:10,949 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash 209343335, 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:36:10,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,288 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:36:11,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:11,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:36:11,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:11,306 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:36:11,306 INFO L182 omatonBuilderFactory]: Interpolants [5824#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 5825#(not (= 12 |#Ultimate.C_memset_#amount|)), 5671#true, 5672#false, 5807#(not (= 12 |zalloc_or_die_#in~size|)), 5808#(= (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)), 5818#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 5819#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5788#(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)|)), 5820#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 5789#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5821#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 5790#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 5822#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 5823#(<= |#Ultimate.C_memset_#t~loopctr49| 3)] [2018-02-04 04:36:11,306 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:36:11,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:36:11,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:36:11,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:36:11,306 INFO L87 Difference]: Start difference. First operand 265 states and 284 transitions. Second operand 15 states. [2018-02-04 04:36:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:12,083 INFO L93 Difference]: Finished difference Result 320 states and 345 transitions. [2018-02-04 04:36:12,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:36:12,083 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 149 [2018-02-04 04:36:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:12,085 INFO L225 Difference]: With dead ends: 320 [2018-02-04 04:36:12,085 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 04:36:12,085 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:36:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 04:36:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 266. [2018-02-04 04:36:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 04:36:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 286 transitions. [2018-02-04 04:36:12,090 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 286 transitions. Word has length 149 [2018-02-04 04:36:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:12,090 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 286 transitions. [2018-02-04 04:36:12,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:36:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 286 transitions. [2018-02-04 04:36:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 04:36:12,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:12,092 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:36:12,092 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:12,092 INFO L82 PathProgramCache]: Analyzing trace with hash -286986233, 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:36:12,105 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,389 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:36:12,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:12,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:36:12,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:12,406 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:36:12,406 INFO L182 omatonBuilderFactory]: Interpolants [6665#(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)|)), 6697#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 6666#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6698#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6667#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 6699#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 6700#(<= |#Ultimate.C_memset_#t~loopctr49| 1), 6701#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 6702#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 6543#true, 6703#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 6544#false, 6704#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 6705#(not (= 12 |#Ultimate.C_memset_#amount|)), 6685#(not (= 12 |zalloc_or_die_#in~size|)), 6686#(= (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:36:12,406 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:36:12,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:36:12,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:36:12,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:36:12,407 INFO L87 Difference]: Start difference. First operand 266 states and 286 transitions. Second operand 16 states. [2018-02-04 04:36:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:13,399 INFO L93 Difference]: Finished difference Result 323 states and 349 transitions. [2018-02-04 04:36:13,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:36:13,399 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 154 [2018-02-04 04:36:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:13,401 INFO L225 Difference]: With dead ends: 323 [2018-02-04 04:36:13,401 INFO L226 Difference]: Without dead ends: 316 [2018-02-04 04:36:13,401 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:36:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-04 04:36:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 267. [2018-02-04 04:36:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-04 04:36:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 288 transitions. [2018-02-04 04:36:13,406 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 288 transitions. Word has length 154 [2018-02-04 04:36:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:13,406 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 288 transitions. [2018-02-04 04:36:13,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:36:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 288 transitions. [2018-02-04 04:36:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 04:36:13,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:13,408 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:36:13,408 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2021218407, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:13,417 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,717 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:36:13,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:13,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:36:13,734 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:13,734 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:36:13,734 INFO L182 omatonBuilderFactory]: Interpolants [7585#(not (= 12 |zalloc_or_die_#in~size|)), 7586#(= (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)), 7564#(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)|)), 7437#true, 7565#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7438#false, 7566#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 7598#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 7599#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7600#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 7601#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 7602#(= |#Ultimate.C_memset_#t~loopctr49| 2), 7603#(= |#Ultimate.C_memset_#t~loopctr49| 3), 7604#(= 4 |#Ultimate.C_memset_#t~loopctr49|), 7605#(= |#Ultimate.C_memset_#t~loopctr49| 5), 7606#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 6)) (and (< 6 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|))), 7607#(<= |#Ultimate.C_memset_#amount| 6)] [2018-02-04 04:36:13,735 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:36:13,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:36:13,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:36:13,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:36:13,735 INFO L87 Difference]: Start difference. First operand 267 states and 288 transitions. Second operand 17 states. [2018-02-04 04:36:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:15,080 INFO L93 Difference]: Finished difference Result 326 states and 353 transitions. [2018-02-04 04:36:15,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:36:15,080 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 159 [2018-02-04 04:36:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:15,081 INFO L225 Difference]: With dead ends: 326 [2018-02-04 04:36:15,081 INFO L226 Difference]: Without dead ends: 319 [2018-02-04 04:36:15,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:36:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-04 04:36:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 268. [2018-02-04 04:36:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 04:36:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2018-02-04 04:36:15,085 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 159 [2018-02-04 04:36:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:15,086 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2018-02-04 04:36:15,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:36:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2018-02-04 04:36:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-04 04:36:15,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:15,087 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:36:15,087 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:15,087 INFO L82 PathProgramCache]: Analyzing trace with hash -3936249, 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:36:15,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,382 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:36:15,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:15,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:36:15,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:15,400 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:36:15,400 INFO L182 omatonBuilderFactory]: Interpolants [8353#true, 8354#false, 8485#(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)|)), 8486#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8487#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 8521#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 8522#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8523#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 8524#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 8525#(= |#Ultimate.C_memset_#t~loopctr49| 2), 8526#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 8527#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 8528#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 8529#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 8530#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 8531#(not (= 12 |#Ultimate.C_memset_#amount|)), 8507#(not (= 12 |zalloc_or_die_#in~size|)), 8508#(= (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:36:15,400 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:36:15,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:36:15,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:36:15,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:36:15,401 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 18 states. [2018-02-04 04:36:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:16,542 INFO L93 Difference]: Finished difference Result 329 states and 357 transitions. [2018-02-04 04:36:16,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:36:16,542 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 164 [2018-02-04 04:36:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:16,544 INFO L225 Difference]: With dead ends: 329 [2018-02-04 04:36:16,544 INFO L226 Difference]: Without dead ends: 322 [2018-02-04 04:36:16,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:36:16,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-04 04:36:16,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2018-02-04 04:36:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-04 04:36:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 292 transitions. [2018-02-04 04:36:16,551 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 292 transitions. Word has length 164 [2018-02-04 04:36:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:16,551 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 292 transitions. [2018-02-04 04:36:16,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:36:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 292 transitions. [2018-02-04 04:36:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 04:36:16,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:16,552 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:36:16,552 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash -80208537, 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:36:16,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 30 proven. 412 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2018-02-04 04:36:16,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:16,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 04:36:16,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-02-04 04:36:16,891 INFO L182 omatonBuilderFactory]: Interpolants [9472#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 9473#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 9474#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 9475#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 9476#(<= |#Ultimate.C_memset_#t~loopctr49| 8), 9477#(not (= 12 |#Ultimate.C_memset_#amount|)), 9291#true, 9451#(not (= 12 |zalloc_or_die_#in~size|)), 9292#false, 9452#(= (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)), 9428#(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)|)), 9429#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9430#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 9466#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 9467#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9468#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 9469#(<= |#Ultimate.C_memset_#t~loopctr49| 1), 9470#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 9471#(<= |#Ultimate.C_memset_#t~loopctr49| 3)] [2018-02-04 04:36:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 30 proven. 412 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2018-02-04 04:36:16,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:36:16,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:36:16,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:36:16,892 INFO L87 Difference]: Start difference. First operand 269 states and 292 transitions. Second operand 19 states. [2018-02-04 04:36:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:17,949 INFO L93 Difference]: Finished difference Result 332 states and 361 transitions. [2018-02-04 04:36:17,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 04:36:17,949 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 169 [2018-02-04 04:36:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:17,950 INFO L225 Difference]: With dead ends: 332 [2018-02-04 04:36:17,950 INFO L226 Difference]: Without dead ends: 325 [2018-02-04 04:36:17,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:36:17,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-04 04:36:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 270. [2018-02-04 04:36:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 04:36:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 294 transitions. [2018-02-04 04:36:17,954 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 294 transitions. Word has length 169 [2018-02-04 04:36:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:17,955 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 294 transitions. [2018-02-04 04:36:17,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:36:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 294 transitions. [2018-02-04 04:36:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-02-04 04:36:17,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:17,955 INFO L351 BasicCegarLoop]: trace histogram [45, 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:36:17,955 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:17,956 INFO L82 PathProgramCache]: Analyzing trace with hash -350113785, now seen corresponding path program 9 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:36:17,958 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 30 proven. 497 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2018-02-04 04:36:18,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:18,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 04:36:18,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-02-04 04:36:18,290 INFO L182 omatonBuilderFactory]: Interpolants [10433#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 10434#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10435#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 10436#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 10437#(= |#Ultimate.C_memset_#t~loopctr49| 2), 10438#(= |#Ultimate.C_memset_#t~loopctr49| 3), 10439#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 10440#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 10441#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 10442#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 10251#true, 10443#(<= |#Ultimate.C_memset_#t~loopctr49| 8), 10252#false, 10444#(<= |#Ultimate.C_memset_#t~loopctr49| 9), 10445#(not (= 12 |#Ultimate.C_memset_#amount|)), 10417#(not (= 12 |zalloc_or_die_#in~size|)), 10418#(= (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)), 10393#(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)|)), 10394#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10395#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12))))] [2018-02-04 04:36:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 30 proven. 497 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2018-02-04 04:36:18,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:36:18,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:36:18,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:36:18,291 INFO L87 Difference]: Start difference. First operand 270 states and 294 transitions. Second operand 20 states. [2018-02-04 04:36:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:19,437 INFO L93 Difference]: Finished difference Result 335 states and 365 transitions. [2018-02-04 04:36:19,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 04:36:19,437 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 174 [2018-02-04 04:36:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:19,438 INFO L225 Difference]: With dead ends: 335 [2018-02-04 04:36:19,438 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 04:36:19,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1292, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 04:36:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 04:36:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2018-02-04 04:36:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-04 04:36:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 296 transitions. [2018-02-04 04:36:19,443 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 296 transitions. Word has length 174 [2018-02-04 04:36:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:19,443 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 296 transitions. [2018-02-04 04:36:19,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:36:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 296 transitions. [2018-02-04 04:36:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-02-04 04:36:19,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:19,444 INFO L351 BasicCegarLoop]: trace histogram [50, 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:36:19,444 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 69116519, now seen corresponding path program 10 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:36:19,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 30 proven. 591 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2018-02-04 04:36:19,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:19,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 04:36:19,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 04:36:19,887 INFO L182 omatonBuilderFactory]: Interpolants [11424#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 11233#true, 11425#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 11234#false, 11426#(= |#Ultimate.C_memset_#t~loopctr49| 2), 11427#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 11428#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 11429#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 11430#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 11431#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 11432#(<= |#Ultimate.C_memset_#t~loopctr49| 8), 11433#(<= |#Ultimate.C_memset_#t~loopctr49| 9), 11434#(<= |#Ultimate.C_memset_#t~loopctr49| 10), 11435#(not (= 12 |#Ultimate.C_memset_#amount|)), 11405#(not (= 12 |zalloc_or_die_#in~size|)), 11406#(= (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)), 11380#(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)|)), 11381#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11382#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 11422#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 11423#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:36:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 30 proven. 591 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2018-02-04 04:36:19,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:36:19,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:36:19,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:36:19,888 INFO L87 Difference]: Start difference. First operand 271 states and 296 transitions. Second operand 21 states. [2018-02-04 04:36:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:21,170 INFO L93 Difference]: Finished difference Result 338 states and 369 transitions. [2018-02-04 04:36:21,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 04:36:21,171 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2018-02-04 04:36:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:21,171 INFO L225 Difference]: With dead ends: 338 [2018-02-04 04:36:21,172 INFO L226 Difference]: Without dead ends: 331 [2018-02-04 04:36:21,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=1407, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:36:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-04 04:36:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 272. [2018-02-04 04:36:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 04:36:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 298 transitions. [2018-02-04 04:36:21,177 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 298 transitions. Word has length 179 [2018-02-04 04:36:21,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:21,177 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 298 transitions. [2018-02-04 04:36:21,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:36:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 298 transitions. [2018-02-04 04:36:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 04:36:21,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:21,178 INFO L351 BasicCegarLoop]: trace histogram [55, 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:36:21,178 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1621741561, now seen corresponding path program 11 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:36:21,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 30 proven. 694 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2018-02-04 04:36:21,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:21,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 04:36:21,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-02-04 04:36:21,561 INFO L182 omatonBuilderFactory]: Interpolants [12416#(= (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)), 12389#(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)|)), 12390#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12391#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 12237#true, 12238#false, 12433#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 12434#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12435#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 12436#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 12437#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 12438#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 12439#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 12440#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 12441#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 12442#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 12443#(<= |#Ultimate.C_memset_#t~loopctr49| 8), 12444#(<= |#Ultimate.C_memset_#t~loopctr49| 9), 12445#(<= |#Ultimate.C_memset_#t~loopctr49| 10), 12446#(<= |#Ultimate.C_memset_#t~loopctr49| 11), 12447#(not (= 12 |#Ultimate.C_memset_#amount|)), 12415#(not (= 12 |zalloc_or_die_#in~size|))] [2018-02-04 04:36:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 30 proven. 694 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2018-02-04 04:36:21,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:36:21,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:36:21,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:36:21,562 INFO L87 Difference]: Start difference. First operand 272 states and 298 transitions. Second operand 22 states. [2018-02-04 04:36:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:22,827 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2018-02-04 04:36:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:36:22,827 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 184 [2018-02-04 04:36:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:22,828 INFO L225 Difference]: With dead ends: 341 [2018-02-04 04:36:22,829 INFO L226 Difference]: Without dead ends: 334 [2018-02-04 04:36:22,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=1530, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:36:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-04 04:36:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 273. [2018-02-04 04:36:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-04 04:36:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 300 transitions. [2018-02-04 04:36:22,833 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 300 transitions. Word has length 184 [2018-02-04 04:36:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:22,833 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 300 transitions. [2018-02-04 04:36:22,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:36:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 300 transitions. [2018-02-04 04:36:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 04:36:22,834 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:22,834 INFO L351 BasicCegarLoop]: trace histogram [60, 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:36:22,834 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:22,834 INFO L82 PathProgramCache]: Analyzing trace with hash -225122457, now seen corresponding path program 12 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:36:22,836 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:22,881 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 04:36:22,888 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:22,888 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:22,888 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:22,888 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:22,894 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:22,895 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:22,895 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:22,895 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:22,898 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 04:36:22,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:36:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2018-02-04 04:36:23,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:23,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 04:36:23,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-02-04 04:36:23,123 INFO L182 omatonBuilderFactory]: Interpolants [13264#false, 13424#(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|)), 13425#(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)))), 13426#(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)|)), 13427#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13420#(= |zalloc_or_die_#in~size| 119), 13469#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13421#(= 119 zalloc_or_die_~size), 13422#(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)), 13263#true, 13423#(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))] [2018-02-04 04:36:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2018-02-04 04:36:23,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:36:23,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:36:23,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=85, Unknown=3, NotChecked=0, Total=110 [2018-02-04 04:36:23,123 INFO L87 Difference]: Start difference. First operand 273 states and 300 transitions. Second operand 11 states. [2018-02-04 04:36:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:23,931 INFO L93 Difference]: Finished difference Result 310 states and 342 transitions. [2018-02-04 04:36:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:36:23,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-02-04 04:36:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:23,933 INFO L225 Difference]: With dead ends: 310 [2018-02-04 04:36:23,933 INFO L226 Difference]: Without dead ends: 310 [2018-02-04 04:36:23,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=288, Unknown=15, NotChecked=0, Total=380 [2018-02-04 04:36:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-02-04 04:36:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 272. [2018-02-04 04:36:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 04:36:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 299 transitions. [2018-02-04 04:36:23,939 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 299 transitions. Word has length 189 [2018-02-04 04:36:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:23,939 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 299 transitions. [2018-02-04 04:36:23,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:36:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 299 transitions. [2018-02-04 04:36:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 04:36:23,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:23,940 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:36:23,941 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:23,941 INFO L82 PathProgramCache]: Analyzing trace with hash 147095120, now seen corresponding path program 1 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:36:23,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:24,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:24,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:36:24,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-02-04 04:36:24,194 INFO L182 omatonBuilderFactory]: Interpolants [14452#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14630#(not (= |zalloc_or_die_#in~size| 119)), 14631#(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))), 14409#(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)|)), 14617#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 14234#true, 14410#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14235#false, 14637#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 14638#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 14639#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-04 04:36:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:24,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:36:24,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:36:24,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:36:24,195 INFO L87 Difference]: Start difference. First operand 272 states and 299 transitions. Second operand 11 states. [2018-02-04 04:36:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:24,952 INFO L93 Difference]: Finished difference Result 310 states and 341 transitions. [2018-02-04 04:36:24,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:36:24,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-02-04 04:36:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:24,954 INFO L225 Difference]: With dead ends: 310 [2018-02-04 04:36:24,954 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 04:36:24,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:36:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 04:36:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2018-02-04 04:36:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 04:36:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 298 transitions. [2018-02-04 04:36:24,958 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 298 transitions. Word has length 202 [2018-02-04 04:36:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:24,959 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 298 transitions. [2018-02-04 04:36:24,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:36:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 298 transitions. [2018-02-04 04:36:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-02-04 04:36:24,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:24,960 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:36:24,960 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1424905330, now seen corresponding path program 2 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:36:24,962 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 195 proven. 1 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:25,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:25,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:36:25,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-02-04 04:36:25,230 INFO L182 omatonBuilderFactory]: Interpolants [15248#true, 15424#(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)|)), 15632#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 15249#false, 15425#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15654#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 15655#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 15656#(and (or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 1)) (and (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|))) (< 0 |#Ultimate.C_memset_#amount|)), 15657#(and (<= |#Ultimate.C_memset_#amount| 1) (< 0 |#Ultimate.C_memset_#amount|)), 15467#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15646#(not (= |zalloc_or_die_#in~size| 119)), 15647#(and (= (mod (* (mod |calloc_model_#in~size| 4294967296) (mod calloc_model_~nmemb 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1))))] [2018-02-04 04:36:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 195 proven. 1 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:25,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:36:25,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:36:25,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:36:25,231 INFO L87 Difference]: Start difference. First operand 272 states and 298 transitions. Second operand 12 states. [2018-02-04 04:36:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:25,992 INFO L93 Difference]: Finished difference Result 310 states and 340 transitions. [2018-02-04 04:36:25,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:36:25,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 203 [2018-02-04 04:36:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:25,993 INFO L225 Difference]: With dead ends: 310 [2018-02-04 04:36:25,993 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 04:36:25,993 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:36:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 04:36:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2018-02-04 04:36:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 04:36:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2018-02-04 04:36:25,997 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 203 [2018-02-04 04:36:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:25,997 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2018-02-04 04:36:25,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:36:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2018-02-04 04:36:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-02-04 04:36:25,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:25,998 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:36:25,998 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:25,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1912651120, now seen corresponding path program 3 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:36:26,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2533 backedges. 260 proven. 3 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:26,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:26,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:36:26,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-02-04 04:36:26,320 INFO L182 omatonBuilderFactory]: Interpolants [16258#true, 16259#false, 16643#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 16658#(not (= |zalloc_or_die_#in~size| 119)), 16435#(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)|)), 16659#(= (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)), 16436#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16667#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 16668#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 16669#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 16478#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16670#(or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 2))), 16671#(<= |#Ultimate.C_memset_#amount| 2)] [2018-02-04 04:36:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2533 backedges. 260 proven. 3 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:26,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:36:26,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:36:26,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:36:26,321 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand 13 states. [2018-02-04 04:36:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:27,137 INFO L93 Difference]: Finished difference Result 310 states and 339 transitions. [2018-02-04 04:36:27,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:36:27,137 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 204 [2018-02-04 04:36:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:27,138 INFO L225 Difference]: With dead ends: 310 [2018-02-04 04:36:27,138 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 04:36:27,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:36:27,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 04:36:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2018-02-04 04:36:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 04:36:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 296 transitions. [2018-02-04 04:36:27,141 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 296 transitions. Word has length 204 [2018-02-04 04:36:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:27,142 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 296 transitions. [2018-02-04 04:36:27,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:36:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 296 transitions. [2018-02-04 04:36:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-02-04 04:36:27,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:27,142 INFO L351 BasicCegarLoop]: trace histogram [63, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:36:27,142 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:27,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1997281330, now seen corresponding path program 4 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:36:27,145 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 325 proven. 6 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:27,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:27,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:36:27,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-02-04 04:36:27,439 INFO L182 omatonBuilderFactory]: Interpolants [17450#(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)|)), 17674#(not (= |zalloc_or_die_#in~size| 119)), 17451#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17675#(= (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)), 17684#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 17493#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17685#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 17686#(<= |#Ultimate.C_memset_#t~loopctr49| 1), 17687#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 17272#true, 17688#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 17273#false, 17689#(not (= |#Ultimate.C_memset_#amount| 119)), 17658#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119)))] [2018-02-04 04:36:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 325 proven. 6 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:27,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:36:27,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:36:27,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:36:27,440 INFO L87 Difference]: Start difference. First operand 272 states and 296 transitions. Second operand 14 states. [2018-02-04 04:36:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:28,251 INFO L93 Difference]: Finished difference Result 310 states and 338 transitions. [2018-02-04 04:36:28,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:36:28,251 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 205 [2018-02-04 04:36:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:28,252 INFO L225 Difference]: With dead ends: 310 [2018-02-04 04:36:28,252 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 04:36:28,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:36:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 04:36:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2018-02-04 04:36:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 04:36:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 295 transitions. [2018-02-04 04:36:28,257 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 295 transitions. Word has length 205 [2018-02-04 04:36:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:28,257 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 295 transitions. [2018-02-04 04:36:28,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:36:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 295 transitions. [2018-02-04 04:36:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-04 04:36:28,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:28,258 INFO L351 BasicCegarLoop]: trace histogram [64, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:36:28,258 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:28,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1348864304, now seen corresponding path program 5 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:36:28,265 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 390 proven. 10 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:28,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:28,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:36:28,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-02-04 04:36:28,585 INFO L182 omatonBuilderFactory]: Interpolants [18469#(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)|)), 18470#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18694#(not (= |zalloc_or_die_#in~size| 119)), 18695#(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))), 18512#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18705#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 18290#true, 18706#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 18291#false, 18707#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 18708#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 18677#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 18709#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 18710#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 18711#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-04 04:36:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 390 proven. 10 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:28,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:36:28,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:36:28,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:36:28,586 INFO L87 Difference]: Start difference. First operand 272 states and 295 transitions. Second operand 15 states. [2018-02-04 04:36:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:29,537 INFO L93 Difference]: Finished difference Result 310 states and 337 transitions. [2018-02-04 04:36:29,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:36:29,537 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 206 [2018-02-04 04:36:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:29,538 INFO L225 Difference]: With dead ends: 310 [2018-02-04 04:36:29,538 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 04:36:29,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:36:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 04:36:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2018-02-04 04:36:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 04:36:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 294 transitions. [2018-02-04 04:36:29,543 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 294 transitions. Word has length 206 [2018-02-04 04:36:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:29,543 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 294 transitions. [2018-02-04 04:36:29,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:36:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 294 transitions. [2018-02-04 04:36:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 04:36:29,544 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:29,544 INFO L351 BasicCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:36:29,544 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:29,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2000163854, now seen corresponding path program 6 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:36:29,561 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2740 backedges. 455 proven. 15 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:29,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:29,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:36:29,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-02-04 04:36:29,960 INFO L182 omatonBuilderFactory]: Interpolants [19498#(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)|)), 19499#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19724#(not (= |zalloc_or_die_#in~size| 119)), 19725#(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)))), 19541#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19318#true, 19319#false, 19736#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 19737#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 19706#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 19738#(<= |#Ultimate.C_memset_#t~loopctr49| 1), 19739#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 19740#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 19741#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 19742#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 19743#(not (= |#Ultimate.C_memset_#amount| 119))] [2018-02-04 04:36:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2740 backedges. 455 proven. 15 refuted. 0 times theorem prover too weak. 2270 trivial. 0 not checked. [2018-02-04 04:36:29,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:36:29,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:36:29,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:36:29,961 INFO L87 Difference]: Start difference. First operand 272 states and 294 transitions. Second operand 16 states. [2018-02-04 04:36:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:30,746 INFO L93 Difference]: Finished difference Result 310 states and 336 transitions. [2018-02-04 04:36:30,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:36:30,746 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 207 [2018-02-04 04:36:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:30,747 INFO L225 Difference]: With dead ends: 310 [2018-02-04 04:36:30,747 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 04:36:30,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:36:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 04:36:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2018-02-04 04:36:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 04:36:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 293 transitions. [2018-02-04 04:36:30,752 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 293 transitions. Word has length 207 [2018-02-04 04:36:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:30,752 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 293 transitions. [2018-02-04 04:36:30,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:36:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 293 transitions. [2018-02-04 04:36:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-02-04 04:36:30,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:30,754 INFO L351 BasicCegarLoop]: trace histogram [66, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:36:30,754 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:30,754 INFO L82 PathProgramCache]: Analyzing trace with hash -715613424, now seen corresponding path program 7 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:36:30,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:31,000 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:36:31,003 INFO L168 Benchmark]: Toolchain (without parser) took 28858.77 ms. Allocated memory was 393.2 MB in the beginning and 1.1 GB in the end (delta: 684.2 MB). Free memory was 349.9 MB in the beginning and 491.5 MB in the end (delta: -141.6 MB). Peak memory consumption was 542.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:36:31,004 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 393.2 MB. Free memory is still 356.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:36:31,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.57 ms. Allocated memory is still 393.2 MB. Free memory was 349.9 MB in the beginning and 336.6 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:36:31,004 INFO L168 Benchmark]: Boogie Preprocessor took 34.97 ms. Allocated memory is still 393.2 MB. Free memory was 336.6 MB in the beginning and 335.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:36:31,004 INFO L168 Benchmark]: RCFGBuilder took 928.40 ms. Allocated memory is still 393.2 MB. Free memory was 335.2 MB in the beginning and 278.1 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB. [2018-02-04 04:36:31,004 INFO L168 Benchmark]: TraceAbstraction took 27705.38 ms. Allocated memory was 393.2 MB in the beginning and 1.1 GB in the end (delta: 684.2 MB). Free memory was 278.1 MB in the beginning and 491.5 MB in the end (delta: -213.4 MB). Peak memory consumption was 470.8 MB. Max. memory is 5.3 GB. [2018-02-04 04:36:31,006 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.17 ms. Allocated memory is still 393.2 MB. Free memory is still 356.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 187.57 ms. Allocated memory is still 393.2 MB. Free memory was 349.9 MB in the beginning and 336.6 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.97 ms. Allocated memory is still 393.2 MB. Free memory was 336.6 MB in the beginning and 335.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 928.40 ms. Allocated memory is still 393.2 MB. Free memory was 335.2 MB in the beginning and 278.1 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 27705.38 ms. Allocated memory was 393.2 MB in the beginning and 1.1 GB in the end (delta: 684.2 MB). Free memory was 278.1 MB in the beginning and 491.5 MB in the end (delta: -213.4 MB). Peak memory consumption was 470.8 MB. 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-0236_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-36-31-013.csv Received shutdown request...