java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 20:25:44,434 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 20:25:44,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 20:25:44,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 20:25:44,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 20:25:44,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 20:25:44,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 20:25:44,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 20:25:44,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 20:25:44,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 20:25:44,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 20:25:44,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 20:25:44,453 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 20:25:44,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 20:25:44,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 20:25:44,456 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 20:25:44,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 20:25:44,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 20:25:44,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 20:25:44,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 20:25:44,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 20:25:44,463 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 20:25:44,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 20:25:44,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 20:25:44,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 20:25:44,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 20:25:44,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 20:25:44,466 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 20:25:44,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 20:25:44,466 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 20:25:44,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 20:25:44,467 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-04 20:25:44,476 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 20:25:44,476 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 20:25:44,477 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 20:25:44,477 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 20:25:44,477 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 20:25:44,477 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 20:25:44,477 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 20:25:44,478 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 20:25:44,478 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 20:25:44,478 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 20:25:44,478 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 20:25:44,478 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 20:25:44,478 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 20:25:44,478 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 20:25:44,478 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 20:25:44,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 20:25:44,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 20:25:44,479 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 20:25:44,479 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 20:25:44,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 20:25:44,479 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 20:25:44,479 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 20:25:44,479 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 20:25:44,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:44,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 20:25:44,514 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 20:25:44,516 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 20:25:44,517 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 20:25:44,518 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 20:25:44,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i [2018-02-04 20:25:44,645 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 20:25:44,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 20:25:44,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 20:25:44,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 20:25:44,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 20:25:44,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:25:44" (1/1) ... [2018-02-04 20:25:44,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ec44b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44, skipping insertion in model container [2018-02-04 20:25:44,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:25:44" (1/1) ... [2018-02-04 20:25:44,663 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:25:44,694 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:25:44,795 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:25:44,816 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:25:44,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44 WrapperNode [2018-02-04 20:25:44,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 20:25:44,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 20:25:44,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 20:25:44,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 20:25:44,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44" (1/1) ... [2018-02-04 20:25:44,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44" (1/1) ... [2018-02-04 20:25:44,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44" (1/1) ... [2018-02-04 20:25:44,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44" (1/1) ... [2018-02-04 20:25:44,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44" (1/1) ... [2018-02-04 20:25:44,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44" (1/1) ... [2018-02-04 20:25:44,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44" (1/1) ... [2018-02-04 20:25:44,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 20:25:44,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 20:25:44,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 20:25:44,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 20:25:44,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 20:25:44,900 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 20:25:44,900 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 20:25:44,901 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 20:25:44,902 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 20:25:44,902 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 20:25:44,903 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 20:25:44,904 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 20:25:44,904 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 20:25:45,239 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 20:25:45,420 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 20:25:45,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:25:45 BoogieIcfgContainer [2018-02-04 20:25:45,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 20:25:45,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 20:25:45,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 20:25:45,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 20:25:45,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 08:25:44" (1/3) ... [2018-02-04 20:25:45,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236f35ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:25:45, skipping insertion in model container [2018-02-04 20:25:45,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:25:44" (2/3) ... [2018-02-04 20:25:45,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236f35ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:25:45, skipping insertion in model container [2018-02-04 20:25:45,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:25:45" (3/3) ... [2018-02-04 20:25:45,426 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_false-valid-deref.i [2018-02-04 20:25:45,431 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 20:25:45,436 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2018-02-04 20:25:45,468 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 20:25:45,468 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 20:25:45,469 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 20:25:45,469 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 20:25:45,469 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 20:25:45,469 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 20:25:45,469 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 20:25:45,469 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 20:25:45,469 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 20:25:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2018-02-04 20:25:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 20:25:45,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:45,491 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 20:25:45,491 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:45,494 INFO L82 PathProgramCache]: Analyzing trace with hash 15319548, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:45,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:25:45,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:25:45,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:25:45,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:25:45,569 INFO L182 omatonBuilderFactory]: Interpolants [278#true, 279#false, 280#(= 1 (select |#valid| |~#list~0.base|))] [2018-02-04 20:25:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:25:45,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 20:25:45,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 20:25:45,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 20:25:45,585 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 3 states. [2018-02-04 20:25:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:45,880 INFO L93 Difference]: Finished difference Result 394 states and 450 transitions. [2018-02-04 20:25:45,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 20:25:45,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 20:25:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:45,895 INFO L225 Difference]: With dead ends: 394 [2018-02-04 20:25:45,895 INFO L226 Difference]: Without dead ends: 391 [2018-02-04 20:25:45,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 20:25:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-04 20:25:46,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 345. [2018-02-04 20:25:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-04 20:25:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 426 transitions. [2018-02-04 20:25:46,013 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 426 transitions. Word has length 4 [2018-02-04 20:25:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:46,013 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 426 transitions. [2018-02-04 20:25:46,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 20:25:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 426 transitions. [2018-02-04 20:25:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 20:25:46,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:46,014 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 20:25:46,014 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash 15319549, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:46,017 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:46,026 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:25:46,029 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:46,029 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:46,030 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:46,030 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:46,059 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-04 20:25:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:25:46,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:25:46,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:25:46,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:25:46,189 INFO L182 omatonBuilderFactory]: Interpolants [1020#true, 1021#false, 1022#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 1023#(and (<= (+ |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (= 4 (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))] [2018-02-04 20:25:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:25:46,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 20:25:46,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 20:25:46,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 20:25:46,191 INFO L87 Difference]: Start difference. First operand 345 states and 426 transitions. Second operand 4 states. [2018-02-04 20:25:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:46,321 INFO L93 Difference]: Finished difference Result 352 states and 436 transitions. [2018-02-04 20:25:46,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 20:25:46,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 20:25:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:46,324 INFO L225 Difference]: With dead ends: 352 [2018-02-04 20:25:46,324 INFO L226 Difference]: Without dead ends: 352 [2018-02-04 20:25:46,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 20:25:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-02-04 20:25:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2018-02-04 20:25:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-04 20:25:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 425 transitions. [2018-02-04 20:25:46,356 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 425 transitions. Word has length 4 [2018-02-04 20:25:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:46,356 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 425 transitions. [2018-02-04 20:25:46,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 20:25:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 425 transitions. [2018-02-04 20:25:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 20:25:46,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:46,357 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:25:46,357 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:46,357 INFO L82 PathProgramCache]: Analyzing trace with hash 116258063, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:46,360 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:46,380 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:25:46,383 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:46,383 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:46,383 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:46,383 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:46,390 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) is different from true [2018-02-04 20:25:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:25:46,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:25:46,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 20:25:46,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:46,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 20:25:46,460 INFO L182 omatonBuilderFactory]: Interpolants [1728#(= 1 (select |#valid| |calloc_model_#t~malloc0.base|)), 1729#(= 1 (select |#valid| calloc_model_~ptr~0.base)), 1730#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1720#true, 1721#false, 1727#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp))] [2018-02-04 20:25:46,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 20:25:46,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 20:25:46,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 20:25:46,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-02-04 20:25:46,461 INFO L87 Difference]: Start difference. First operand 344 states and 425 transitions. Second operand 6 states. [2018-02-04 20:25:46,488 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_~#list~0.base| |c_old(~#list~0.base)|) (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) (= |c_#valid| |c_old(#valid)|) (= |c_~#list~0.offset| |c_old(~#list~0.offset)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2018-02-04 20:25:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:47,163 INFO L93 Difference]: Finished difference Result 432 states and 529 transitions. [2018-02-04 20:25:47,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 20:25:47,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 20:25:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:47,167 INFO L225 Difference]: With dead ends: 432 [2018-02-04 20:25:47,167 INFO L226 Difference]: Without dead ends: 432 [2018-02-04 20:25:47,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56 [2018-02-04 20:25:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-02-04 20:25:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 388. [2018-02-04 20:25:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-04 20:25:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 501 transitions. [2018-02-04 20:25:47,183 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 501 transitions. Word has length 17 [2018-02-04 20:25:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:47,184 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 501 transitions. [2018-02-04 20:25:47,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 20:25:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 501 transitions. [2018-02-04 20:25:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 20:25:47,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:47,184 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:25:47,185 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:47,185 INFO L82 PathProgramCache]: Analyzing trace with hash 116258064, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:47,188 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:47,204 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 20:25:47,225 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:47,225 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:47,226 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:47,226 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:47,236 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:47,236 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:47,236 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:47,237 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:25:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:25:47,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:25:47,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 20:25:47,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:25:47,361 INFO L182 omatonBuilderFactory]: Interpolants [2562#(= |zalloc_or_die_#in~size| 8), 2563#(= 8 zalloc_or_die_~size), 2564#(exists ((%0 (Array Int Int))) (! (and (= |calloc_model_#in~size| 8) (= |calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 8) (store |#length| %1 8)) :qid itp))) :qid itp)), 2565#(exists ((%0 (Array Int Int))) (! (and (= (ite (<= (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) 2147483647) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (+ (- 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))) 8) (forall ((%1 Int)) (! (= (store %0 %1 8) (store |#length| %1 8)) :qid itp))) :qid itp)), 2566#(and (= 8 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (= 8 (select |#length| |calloc_model_#t~malloc0.base|)) (= 0 |calloc_model_#t~malloc0.offset|)), 2567#(and (<= 0 calloc_model_~ptr~0.offset) (or (and (< 2147483647 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (+ (select |#length| calloc_model_~ptr~0.base) 4294967296))) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (select |#length| calloc_model_~ptr~0.base)))), 2568#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2555#true, 2556#false] [2018-02-04 20:25:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 20:25:47,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:25:47,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:25:47,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=56, Unknown=1, NotChecked=0, Total=72 [2018-02-04 20:25:47,361 INFO L87 Difference]: Start difference. First operand 388 states and 501 transitions. Second operand 9 states. [2018-02-04 20:25:47,423 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_~#list~0.base| |c_old(~#list~0.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((%0 (Array Int Int))) (! (and (= |c_calloc_model_#in~size| 8) (= |c_calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 8) (store |c_#length| %1 8)) :qid itp))) :qid itp)) (= |c_~#list~0.offset| |c_old(~#list~0.offset)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2018-02-04 20:25:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:48,426 INFO L93 Difference]: Finished difference Result 445 states and 543 transitions. [2018-02-04 20:25:48,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 20:25:48,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 20:25:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:48,428 INFO L225 Difference]: With dead ends: 445 [2018-02-04 20:25:48,428 INFO L226 Difference]: Without dead ends: 445 [2018-02-04 20:25:48,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=121, Unknown=3, NotChecked=22, Total=182 [2018-02-04 20:25:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-04 20:25:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 401. [2018-02-04 20:25:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-04 20:25:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 514 transitions. [2018-02-04 20:25:48,441 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 514 transitions. Word has length 17 [2018-02-04 20:25:48,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:48,442 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 514 transitions. [2018-02-04 20:25:48,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:25:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 514 transitions. [2018-02-04 20:25:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 20:25:48,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:48,445 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 20:25:48,447 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash 612491321, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:48,454 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:48,776 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 20:25:48,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:25:48,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 20:25:48,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:48,809 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 20:25:48,809 INFO L182 omatonBuilderFactory]: Interpolants [3425#true, 3426#false, 3522#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3523#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3541#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3606#(not (= 8 |zalloc_or_die_#in~size|)), 3607#(and (= (mod (* (mod |calloc_model_#in~size| 4294967296) (mod calloc_model_~nmemb 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 3593#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 3613#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 8))), 3614#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 3615#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-04 20:25:48,809 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 20:25:48,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:25:48,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:25:48,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:25:48,810 INFO L87 Difference]: Start difference. First operand 401 states and 514 transitions. Second operand 11 states. [2018-02-04 20:25:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:49,962 INFO L93 Difference]: Finished difference Result 459 states and 556 transitions. [2018-02-04 20:25:49,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 20:25:49,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-02-04 20:25:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:49,964 INFO L225 Difference]: With dead ends: 459 [2018-02-04 20:25:49,964 INFO L226 Difference]: Without dead ends: 452 [2018-02-04 20:25:49,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:25:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-02-04 20:25:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 404. [2018-02-04 20:25:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-02-04 20:25:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 518 transitions. [2018-02-04 20:25:49,970 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 518 transitions. Word has length 129 [2018-02-04 20:25:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:49,971 INFO L432 AbstractCegarLoop]: Abstraction has 404 states and 518 transitions. [2018-02-04 20:25:49,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:25:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 518 transitions. [2018-02-04 20:25:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 20:25:49,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:49,972 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 20:25:49,972 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash -750293478, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:49,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:50,228 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 20:25:50,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:25:50,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:25:50,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:50,245 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 20:25:50,245 INFO L182 omatonBuilderFactory]: Interpolants [4626#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 4627#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4500#true, 4628#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 4501#false, 4629#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 1)) (and (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|))), 4630#(<= |#Ultimate.C_memset_#amount| 1), 4602#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4618#(not (= 8 |zalloc_or_die_#in~size|)), 4603#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4619#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 4604#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8)))] [2018-02-04 20:25:50,245 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 20:25:50,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:25:50,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:25:50,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:25:50,246 INFO L87 Difference]: Start difference. First operand 404 states and 518 transitions. Second operand 12 states. [2018-02-04 20:25:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:51,205 INFO L93 Difference]: Finished difference Result 465 states and 563 transitions. [2018-02-04 20:25:51,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:25:51,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2018-02-04 20:25:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:51,207 INFO L225 Difference]: With dead ends: 465 [2018-02-04 20:25:51,207 INFO L226 Difference]: Without dead ends: 458 [2018-02-04 20:25:51,208 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 20:25:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-04 20:25:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 405. [2018-02-04 20:25:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-04 20:25:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 520 transitions. [2018-02-04 20:25:51,217 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 520 transitions. Word has length 134 [2018-02-04 20:25:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:51,217 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 520 transitions. [2018-02-04 20:25:51,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:25:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 520 transitions. [2018-02-04 20:25:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 20:25:51,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:51,219 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 20:25:51,219 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1870375513, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:51,222 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:51,472 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 20:25:51,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:25:51,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:25:51,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:51,490 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 20:25:51,490 INFO L182 omatonBuilderFactory]: Interpolants [5602#true, 5603#false, 5735#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 5736#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5737#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 5738#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 5739#(or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 2))), 5740#(<= |#Ultimate.C_memset_#amount| 2), 5709#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5710#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5711#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 5726#(not (= 8 |zalloc_or_die_#in~size|)), 5727#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))] [2018-02-04 20:25:51,490 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 20:25:51,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:25:51,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:25:51,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:25:51,491 INFO L87 Difference]: Start difference. First operand 405 states and 520 transitions. Second operand 13 states. [2018-02-04 20:25:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:52,556 INFO L93 Difference]: Finished difference Result 468 states and 567 transitions. [2018-02-04 20:25:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 20:25:52,556 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2018-02-04 20:25:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:52,558 INFO L225 Difference]: With dead ends: 468 [2018-02-04 20:25:52,559 INFO L226 Difference]: Without dead ends: 461 [2018-02-04 20:25:52,559 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 20:25:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-04 20:25:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 406. [2018-02-04 20:25:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-02-04 20:25:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 522 transitions. [2018-02-04 20:25:52,569 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 522 transitions. Word has length 139 [2018-02-04 20:25:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:52,569 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 522 transitions. [2018-02-04 20:25:52,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:25:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 522 transitions. [2018-02-04 20:25:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-04 20:25:52,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:52,571 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 20:25:52,571 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1443053562, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:52,575 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:52,830 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 20:25:52,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:25:52,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:25:52,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:52,848 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 20:25:52,848 INFO L182 omatonBuilderFactory]: Interpolants [6726#true, 6727#false, 6856#(not (= 8 |zalloc_or_die_#in~size|)), 6857#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 6866#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 6867#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6868#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 6869#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 6838#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6870#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 6839#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6871#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 6840#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 6872#(not (= 8 |#Ultimate.C_memset_#amount|))] [2018-02-04 20:25:52,848 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 20:25:52,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:25:52,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:25:52,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:25:52,848 INFO L87 Difference]: Start difference. First operand 406 states and 522 transitions. Second operand 14 states. [2018-02-04 20:25:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:53,876 INFO L93 Difference]: Finished difference Result 471 states and 571 transitions. [2018-02-04 20:25:53,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 20:25:53,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-02-04 20:25:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:53,878 INFO L225 Difference]: With dead ends: 471 [2018-02-04 20:25:53,878 INFO L226 Difference]: Without dead ends: 464 [2018-02-04 20:25:53,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-02-04 20:25:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-04 20:25:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 407. [2018-02-04 20:25:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-04 20:25:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 524 transitions. [2018-02-04 20:25:53,884 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 524 transitions. Word has length 144 [2018-02-04 20:25:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:53,884 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 524 transitions. [2018-02-04 20:25:53,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:25:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 524 transitions. [2018-02-04 20:25:53,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 20:25:53,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:53,885 INFO L351 BasicCegarLoop]: trace histogram [20, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:25:53,885 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:53,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1407298681, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:53,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:54,198 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 20:25:54,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:25:54,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:25:54,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:54,215 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 20:25:54,215 INFO L182 omatonBuilderFactory]: Interpolants [7872#true, 7873#false, 8008#(not (= 8 |zalloc_or_die_#in~size|)), 8009#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 8019#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 8020#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7989#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8021#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 7990#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8022#(= |#Ultimate.C_memset_#t~loopctr49| 1), 7991#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 8023#(= |#Ultimate.C_memset_#t~loopctr49| 2), 8024#(= |#Ultimate.C_memset_#t~loopctr49| 3), 8025#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 4)) (and (< 4 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|))), 8026#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-04 20:25:54,215 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 20:25:54,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:25:54,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:25:54,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:25:54,216 INFO L87 Difference]: Start difference. First operand 407 states and 524 transitions. Second operand 15 states. [2018-02-04 20:25:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:55,454 INFO L93 Difference]: Finished difference Result 474 states and 575 transitions. [2018-02-04 20:25:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 20:25:55,455 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 149 [2018-02-04 20:25:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:55,457 INFO L225 Difference]: With dead ends: 474 [2018-02-04 20:25:55,457 INFO L226 Difference]: Without dead ends: 467 [2018-02-04 20:25:55,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2018-02-04 20:25:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-04 20:25:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 408. [2018-02-04 20:25:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 20:25:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 526 transitions. [2018-02-04 20:25:55,463 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 526 transitions. Word has length 149 [2018-02-04 20:25:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:55,463 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 526 transitions. [2018-02-04 20:25:55,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:25:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 526 transitions. [2018-02-04 20:25:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 20:25:55,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:55,465 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 20:25:55,465 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash -114763302, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:55,473 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:55,884 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 20:25:55,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:25:55,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:25:55,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:55,902 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 20:25:55,902 INFO L182 omatonBuilderFactory]: Interpolants [9162#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9194#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 9163#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9195#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9164#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 9196#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 9197#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 9198#(= |#Ultimate.C_memset_#t~loopctr49| 2), 9199#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 9040#true, 9200#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 9041#false, 9201#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 9202#(not (= 8 |#Ultimate.C_memset_#amount|)), 9182#(not (= 8 |zalloc_or_die_#in~size|)), 9183#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))] [2018-02-04 20:25:55,902 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 20:25:55,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:25:55,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:25:55,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:25:55,902 INFO L87 Difference]: Start difference. First operand 408 states and 526 transitions. Second operand 16 states. [2018-02-04 20:25:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:57,270 INFO L93 Difference]: Finished difference Result 477 states and 579 transitions. [2018-02-04 20:25:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 20:25:57,270 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 154 [2018-02-04 20:25:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:57,272 INFO L225 Difference]: With dead ends: 477 [2018-02-04 20:25:57,272 INFO L226 Difference]: Without dead ends: 470 [2018-02-04 20:25:57,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:25:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-04 20:25:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 409. [2018-02-04 20:25:57,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-04 20:25:57,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 528 transitions. [2018-02-04 20:25:57,281 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 528 transitions. Word has length 154 [2018-02-04 20:25:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:57,282 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 528 transitions. [2018-02-04 20:25:57,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:25:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 528 transitions. [2018-02-04 20:25:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 20:25:57,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:57,284 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 20:25:57,284 INFO L371 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1808131737, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:57,288 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:57,581 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 20:25:57,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:25:57,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:25:57,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:57,598 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 20:25:57,598 INFO L182 omatonBuilderFactory]: Interpolants [10400#(not (= 8 |#Ultimate.C_memset_#amount|)), 10378#(not (= 8 |zalloc_or_die_#in~size|)), 10379#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 10357#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10230#true, 10358#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10231#false, 10359#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 10391#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 10392#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10393#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 10394#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 10395#(= |#Ultimate.C_memset_#t~loopctr49| 2), 10396#(= |#Ultimate.C_memset_#t~loopctr49| 3), 10397#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 10398#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 10399#(<= |#Ultimate.C_memset_#t~loopctr49| 6)] [2018-02-04 20:25:57,599 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 20:25:57,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:25:57,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:25:57,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:25:57,599 INFO L87 Difference]: Start difference. First operand 409 states and 528 transitions. Second operand 17 states. [2018-02-04 20:25:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:25:58,896 INFO L93 Difference]: Finished difference Result 480 states and 583 transitions. [2018-02-04 20:25:58,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 20:25:58,896 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 159 [2018-02-04 20:25:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:25:58,898 INFO L225 Difference]: With dead ends: 480 [2018-02-04 20:25:58,898 INFO L226 Difference]: Without dead ends: 473 [2018-02-04 20:25:58,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 20:25:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-04 20:25:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 410. [2018-02-04 20:25:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 20:25:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2018-02-04 20:25:58,905 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 159 [2018-02-04 20:25:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:25:58,905 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2018-02-04 20:25:58,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:25:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2018-02-04 20:25:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-04 20:25:58,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:25:58,906 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 20:25:58,906 INFO L371 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:25:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash -194626630, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:25:58,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:25:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:25:59,235 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 20:25:59,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:25:59,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:25:59,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:25:59,252 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 20:25:59,252 INFO L182 omatonBuilderFactory]: Interpolants [11616#(= 4 |#Ultimate.C_memset_#t~loopctr49|), 11617#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 11618#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 11619#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 11620#(not (= 8 |#Ultimate.C_memset_#amount|)), 11596#(not (= 8 |zalloc_or_die_#in~size|)), 11597#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 11442#true, 11443#false, 11574#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11575#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11576#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 11610#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 11611#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11612#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 11613#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 11614#(= |#Ultimate.C_memset_#t~loopctr49| 2), 11615#(= |#Ultimate.C_memset_#t~loopctr49| 3)] [2018-02-04 20:25:59,252 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 20:25:59,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:25:59,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:25:59,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:25:59,253 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand 18 states. [2018-02-04 20:26:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:00,516 INFO L93 Difference]: Finished difference Result 483 states and 587 transitions. [2018-02-04 20:26:00,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 20:26:00,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 164 [2018-02-04 20:26:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:00,517 INFO L225 Difference]: With dead ends: 483 [2018-02-04 20:26:00,517 INFO L226 Difference]: Without dead ends: 476 [2018-02-04 20:26:00,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 20:26:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-02-04 20:26:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 411. [2018-02-04 20:26:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 20:26:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 532 transitions. [2018-02-04 20:26:00,524 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 532 transitions. Word has length 164 [2018-02-04 20:26:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:00,524 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 532 transitions. [2018-02-04 20:26:00,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:26:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 532 transitions. [2018-02-04 20:26:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 20:26:00,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:00,526 INFO L351 BasicCegarLoop]: trace histogram [40, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:00,526 INFO L371 AbstractCegarLoop]: === Iteration 13 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1622825145, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:00,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,582 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-02-04 20:26:00,594 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:26:00,594 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:26:00,594 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:26:00,594 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:26:00,600 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:26:00,600 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:26:00,600 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:26:00,600 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:26:00,603 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 20:26:00,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 20:26:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2018-02-04 20:26:00,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:00,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 20:26:00,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-02-04 20:26:00,813 INFO L182 omatonBuilderFactory]: Interpolants [12816#(exists ((%0 (Array Int Int))) (! (and (= (ite (<= (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) 2147483647) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (+ (- 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))) 119) (forall ((%1 Int)) (! (= (store %0 %1 119) (store |#length| %1 119)) :qid itp))) :qid itp)), 12817#(and (= 119 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (= 119 (select |#length| |calloc_model_#t~malloc0.base|)) (= 0 |calloc_model_#t~malloc0.offset|)), 12818#(and (<= 0 calloc_model_~ptr~0.offset) (or (and (< 2147483647 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (+ (select |#length| calloc_model_~ptr~0.base) 4294967296))) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (select |#length| calloc_model_~ptr~0.base)))), 12819#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12676#true, 12820#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12677#false, 12854#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12813#(= |zalloc_or_die_#in~size| 119), 12814#(= 119 zalloc_or_die_~size), 12815#(exists ((%0 (Array Int Int))) (! (and (= |calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 119) (store |#length| %1 119)) :qid itp)) (= |calloc_model_#in~size| 119)) :qid itp))] [2018-02-04 20:26:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2018-02-04 20:26:00,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:26:00,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:26:00,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=87, Unknown=1, NotChecked=0, Total=110 [2018-02-04 20:26:00,813 INFO L87 Difference]: Start difference. First operand 411 states and 532 transitions. Second operand 11 states. [2018-02-04 20:26:00,957 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 (= (let ((.cse0 (mod (* (mod c_calloc_model_~nmemb 4294967296) (mod c_calloc_model_~size 4294967296)) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 119) (forall ((%1 Int)) (! (= (store %0 %1 119) (store |c_#length| %1 119)) :qid itp))) :qid itp)) (exists ((%0 (Array Int Int))) (! (and (= |c_calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 119) (store |c_#length| %1 119)) :qid itp)) (= |c_calloc_model_#in~size| 119)) :qid itp)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2018-02-04 20:26:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:01,793 INFO L93 Difference]: Finished difference Result 453 states and 557 transitions. [2018-02-04 20:26:01,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 20:26:01,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2018-02-04 20:26:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:01,796 INFO L225 Difference]: With dead ends: 453 [2018-02-04 20:26:01,796 INFO L226 Difference]: Without dead ends: 453 [2018-02-04 20:26:01,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=186, Unknown=5, NotChecked=28, Total=272 [2018-02-04 20:26:01,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-04 20:26:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-02-04 20:26:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 20:26:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 531 transitions. [2018-02-04 20:26:01,802 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 531 transitions. Word has length 169 [2018-02-04 20:26:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:01,803 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 531 transitions. [2018-02-04 20:26:01,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:26:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 531 transitions. [2018-02-04 20:26:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 20:26:01,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:01,804 INFO L351 BasicCegarLoop]: trace histogram [40, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:01,804 INFO L371 AbstractCegarLoop]: === Iteration 14 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1025496070, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:01,806 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:02,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:26:02,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 20:26:02,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:02,131 INFO L182 omatonBuilderFactory]: Interpolants [14017#(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)|)), 14018#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14052#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13862#true, 14198#(not (= 119 |zalloc_or_die_#in~size|)), 13863#false, 14199#(and (= |calloc_model_#in~size| calloc_model_~size) (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))), 14185#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 14205#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 14206#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 14207#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-04 20:26:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:02,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:26:02,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:26:02,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:26:02,132 INFO L87 Difference]: Start difference. First operand 410 states and 531 transitions. Second operand 11 states. [2018-02-04 20:26:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:03,277 INFO L93 Difference]: Finished difference Result 460 states and 563 transitions. [2018-02-04 20:26:03,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:26:03,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 182 [2018-02-04 20:26:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:03,279 INFO L225 Difference]: With dead ends: 460 [2018-02-04 20:26:03,279 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 20:26:03,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:26:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 20:26:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 20:26:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 20:26:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2018-02-04 20:26:03,286 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 182 [2018-02-04 20:26:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:03,286 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2018-02-04 20:26:03,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:26:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2018-02-04 20:26:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-04 20:26:03,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:03,287 INFO L351 BasicCegarLoop]: trace histogram [41, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:03,287 INFO L371 AbstractCegarLoop]: === Iteration 15 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:03,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1838740207, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:03,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 155 proven. 1 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:03,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:03,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:26:03,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:03,578 INFO L182 omatonBuilderFactory]: Interpolants [15104#true, 15105#false, 15442#(not (= |zalloc_or_die_#in~size| 119)), 15443#(= (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)), 15428#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 15450#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 15451#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 15260#(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)|)), 15452#(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|))), 15261#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15453#(<= |#Ultimate.C_memset_#amount| 1), 15295#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:26:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 155 proven. 1 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:03,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:26:03,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:26:03,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:26:03,578 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand 12 states. [2018-02-04 20:26:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:04,470 INFO L93 Difference]: Finished difference Result 460 states and 562 transitions. [2018-02-04 20:26:04,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 20:26:04,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 183 [2018-02-04 20:26:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:04,471 INFO L225 Difference]: With dead ends: 460 [2018-02-04 20:26:04,471 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 20:26:04,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:26:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 20:26:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 20:26:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 20:26:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 529 transitions. [2018-02-04 20:26:04,476 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 529 transitions. Word has length 183 [2018-02-04 20:26:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:04,476 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 529 transitions. [2018-02-04 20:26:04,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:26:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 529 transitions. [2018-02-04 20:26:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 20:26:04,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:04,476 INFO L351 BasicCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:04,477 INFO L371 AbstractCegarLoop]: === Iteration 16 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:04,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1279504678, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:04,482 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 200 proven. 3 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:04,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:04,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:26:04,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:04,779 INFO L182 omatonBuilderFactory]: Interpolants [16682#(not (= |zalloc_or_die_#in~size| 119)), 16683#(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))), 16499#(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)|)), 16691#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 16500#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16692#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 16693#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 16342#true, 16534#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16694#(and (< 1 |#Ultimate.C_memset_#amount|) (or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 2)))), 16343#false, 16695#(= |#Ultimate.C_memset_#amount| 2), 16667#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 20:26:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 200 proven. 3 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:04,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:26:04,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:26:04,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:26:04,780 INFO L87 Difference]: Start difference. First operand 410 states and 529 transitions. Second operand 13 states. [2018-02-04 20:26:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:05,702 INFO L93 Difference]: Finished difference Result 460 states and 561 transitions. [2018-02-04 20:26:05,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 20:26:05,703 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 184 [2018-02-04 20:26:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:05,704 INFO L225 Difference]: With dead ends: 460 [2018-02-04 20:26:05,704 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 20:26:05,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-02-04 20:26:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 20:26:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 20:26:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 20:26:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 528 transitions. [2018-02-04 20:26:05,709 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 528 transitions. Word has length 184 [2018-02-04 20:26:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:05,710 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 528 transitions. [2018-02-04 20:26:05,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:26:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 528 transitions. [2018-02-04 20:26:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 20:26:05,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:05,711 INFO L351 BasicCegarLoop]: trace histogram [43, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:05,711 INFO L371 AbstractCegarLoop]: === Iteration 17 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1123072463, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:05,732 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 245 proven. 6 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:06,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:06,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:26:06,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:06,145 INFO L182 omatonBuilderFactory]: Interpolants [17932#(not (= |zalloc_or_die_#in~size| 119)), 17933#(= (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)), 17748#(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)|)), 17749#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17590#true, 17942#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 17591#false, 17783#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17943#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 17944#(<= |#Ultimate.C_memset_#t~loopctr49| 1), 17945#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 17946#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 17947#(not (= |#Ultimate.C_memset_#amount| 119)), 17916#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 20:26:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 245 proven. 6 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:06,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:26:06,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:26:06,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:26:06,146 INFO L87 Difference]: Start difference. First operand 410 states and 528 transitions. Second operand 14 states. [2018-02-04 20:26:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:07,166 INFO L93 Difference]: Finished difference Result 460 states and 560 transitions. [2018-02-04 20:26:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 20:26:07,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2018-02-04 20:26:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:07,168 INFO L225 Difference]: With dead ends: 460 [2018-02-04 20:26:07,168 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 20:26:07,168 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 20:26:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 20:26:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 20:26:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 20:26:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 527 transitions. [2018-02-04 20:26:07,173 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 527 transitions. Word has length 185 [2018-02-04 20:26:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:07,173 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 527 transitions. [2018-02-04 20:26:07,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:26:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 527 transitions. [2018-02-04 20:26:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-02-04 20:26:07,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:07,174 INFO L351 BasicCegarLoop]: trace histogram [44, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:07,174 INFO L371 AbstractCegarLoop]: === Iteration 18 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:07,174 INFO L82 PathProgramCache]: Analyzing trace with hash -568641094, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:07,178 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 290 proven. 10 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:07,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:07,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:26:07,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:07,506 INFO L182 omatonBuilderFactory]: Interpolants [19180#(not (= |zalloc_or_die_#in~size| 119)), 19181#(= (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)), 18995#(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)|)), 18836#true, 18996#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18837#false, 19030#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19191#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 19192#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 19193#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 19194#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 19163#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 19195#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 19196#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 19197#(not (= |#Ultimate.C_memset_#amount| 119))] [2018-02-04 20:26:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 290 proven. 10 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:07,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:26:07,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:26:07,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:26:07,507 INFO L87 Difference]: Start difference. First operand 410 states and 527 transitions. Second operand 15 states. [2018-02-04 20:26:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:08,512 INFO L93 Difference]: Finished difference Result 460 states and 559 transitions. [2018-02-04 20:26:08,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:26:08,513 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2018-02-04 20:26:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:08,514 INFO L225 Difference]: With dead ends: 460 [2018-02-04 20:26:08,514 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 20:26:08,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:26:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 20:26:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 20:26:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 20:26:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 526 transitions. [2018-02-04 20:26:08,519 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 526 transitions. Word has length 186 [2018-02-04 20:26:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:08,519 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 526 transitions. [2018-02-04 20:26:08,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:26:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 526 transitions. [2018-02-04 20:26:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 20:26:08,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:08,520 INFO L351 BasicCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:08,520 INFO L371 AbstractCegarLoop]: === Iteration 19 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash -561137839, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:08,524 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 335 proven. 15 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:08,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:08,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:26:08,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:08,926 INFO L182 omatonBuilderFactory]: Interpolants [20448#(= |#Ultimate.C_memset_#t~loopctr49| 3), 20449#(= 4 |#Ultimate.C_memset_#t~loopctr49|), 20450#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 5)) (and (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|) (< 5 |#Ultimate.C_memset_#amount|))), 20451#(<= |#Ultimate.C_memset_#amount| 5), 20432#(not (= |zalloc_or_die_#in~size| 119)), 20433#(= (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)), 20086#true, 20246#(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)|)), 20087#false, 20247#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20281#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20444#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 20445#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 20414#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 20446#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 20447#(= |#Ultimate.C_memset_#t~loopctr49| 2)] [2018-02-04 20:26:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 335 proven. 15 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:08,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:26:08,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:26:08,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:26:08,927 INFO L87 Difference]: Start difference. First operand 410 states and 526 transitions. Second operand 16 states. [2018-02-04 20:26:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:09,999 INFO L93 Difference]: Finished difference Result 460 states and 558 transitions. [2018-02-04 20:26:09,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 20:26:09,999 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 187 [2018-02-04 20:26:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:10,000 INFO L225 Difference]: With dead ends: 460 [2018-02-04 20:26:10,000 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 20:26:10,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-02-04 20:26:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 20:26:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 20:26:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 20:26:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 525 transitions. [2018-02-04 20:26:10,004 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 525 transitions. Word has length 187 [2018-02-04 20:26:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:10,005 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 525 transitions. [2018-02-04 20:26:10,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:26:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 525 transitions. [2018-02-04 20:26:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-04 20:26:10,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:10,005 INFO L351 BasicCegarLoop]: trace histogram [46, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:10,005 INFO L371 AbstractCegarLoop]: === Iteration 20 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -328536934, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:10,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 380 proven. 21 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:10,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:10,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:26:10,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:10,307 INFO L182 omatonBuilderFactory]: Interpolants [21536#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21669#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 21701#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 21702#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 21703#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 21704#(= |#Ultimate.C_memset_#t~loopctr49| 2), 21705#(= |#Ultimate.C_memset_#t~loopctr49| 3), 21706#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 21707#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 21708#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 21709#(not (= |#Ultimate.C_memset_#amount| 119)), 21688#(not (= |zalloc_or_die_#in~size| 119)), 21689#(= (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)), 21340#true, 21341#false, 21501#(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)|)), 21502#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:26:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 380 proven. 21 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:10,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:26:10,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:26:10,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:26:10,308 INFO L87 Difference]: Start difference. First operand 410 states and 525 transitions. Second operand 17 states. [2018-02-04 20:26:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:11,261 INFO L93 Difference]: Finished difference Result 460 states and 557 transitions. [2018-02-04 20:26:11,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 20:26:11,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 188 [2018-02-04 20:26:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:11,263 INFO L225 Difference]: With dead ends: 460 [2018-02-04 20:26:11,263 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 20:26:11,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:26:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 20:26:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-04 20:26:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 20:26:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 524 transitions. [2018-02-04 20:26:11,267 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 524 transitions. Word has length 188 [2018-02-04 20:26:11,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:11,267 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 524 transitions. [2018-02-04 20:26:11,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:26:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 524 transitions. [2018-02-04 20:26:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 20:26:11,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:11,268 INFO L351 BasicCegarLoop]: trace histogram [47, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:11,269 INFO L371 AbstractCegarLoop]: === Iteration 21 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:11,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1707843471, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:11,274 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 425 proven. 28 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:11,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:11,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:26:11,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:11,628 INFO L182 omatonBuilderFactory]: Interpolants [22948#(not (= |zalloc_or_die_#in~size| 119)), 22949#(= (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)), 22598#true, 22599#false, 22760#(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)|)), 22761#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22795#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22928#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 22962#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 22963#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 22964#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 22965#(= |#Ultimate.C_memset_#t~loopctr49| 2), 22966#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 22967#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 22968#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 22969#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 22970#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 22971#(not (= |#Ultimate.C_memset_#amount| 119))] [2018-02-04 20:26:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 425 proven. 28 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:11,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:26:11,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:26:11,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:26:11,629 INFO L87 Difference]: Start difference. First operand 410 states and 524 transitions. Second operand 18 states. [2018-02-04 20:26:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:12,784 INFO L93 Difference]: Finished difference Result 458 states and 554 transitions. [2018-02-04 20:26:12,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 20:26:12,784 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 189 [2018-02-04 20:26:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:12,785 INFO L225 Difference]: With dead ends: 458 [2018-02-04 20:26:12,785 INFO L226 Difference]: Without dead ends: 449 [2018-02-04 20:26:12,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2018-02-04 20:26:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-04 20:26:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 408. [2018-02-04 20:26:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 20:26:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 521 transitions. [2018-02-04 20:26:12,789 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 521 transitions. Word has length 189 [2018-02-04 20:26:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:12,790 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 521 transitions. [2018-02-04 20:26:12,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:26:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 521 transitions. [2018-02-04 20:26:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-04 20:26:12,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:12,790 INFO L351 BasicCegarLoop]: trace histogram [48, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:12,790 INFO L371 AbstractCegarLoop]: === Iteration 22 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1516673158, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:12,805 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 470 proven. 36 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:13,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:13,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 20:26:13,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:13,119 INFO L182 omatonBuilderFactory]: Interpolants [24224#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 24225#(<= |#Ultimate.C_memset_#t~loopctr49| 1), 24226#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 24227#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 24228#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 24229#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 24230#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 24231#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 24232#(<= |#Ultimate.C_memset_#t~loopctr49| 8), 24233#(not (= |#Ultimate.C_memset_#amount| 119)), 23856#true, 24208#(not (= |zalloc_or_die_#in~size| 119)), 23857#false, 24209#(= (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)), 24019#(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)|)), 24020#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24054#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24187#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 24223#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119))] [2018-02-04 20:26:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 470 proven. 36 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:13,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 20:26:13,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 20:26:13,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-02-04 20:26:13,120 INFO L87 Difference]: Start difference. First operand 408 states and 521 transitions. Second operand 19 states. [2018-02-04 20:26:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:14,247 INFO L93 Difference]: Finished difference Result 462 states and 559 transitions. [2018-02-04 20:26:14,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 20:26:14,247 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2018-02-04 20:26:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:14,248 INFO L225 Difference]: With dead ends: 462 [2018-02-04 20:26:14,248 INFO L226 Difference]: Without dead ends: 455 [2018-02-04 20:26:14,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-02-04 20:26:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-04 20:26:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-02-04 20:26:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 20:26:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 525 transitions. [2018-02-04 20:26:14,253 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 525 transitions. Word has length 190 [2018-02-04 20:26:14,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:14,253 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 525 transitions. [2018-02-04 20:26:14,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 20:26:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 525 transitions. [2018-02-04 20:26:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-04 20:26:14,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:14,254 INFO L351 BasicCegarLoop]: trace histogram [49, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:14,254 INFO L371 AbstractCegarLoop]: === Iteration 23 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:14,254 INFO L82 PathProgramCache]: Analyzing trace with hash 114639249, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:14,260 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 515 proven. 45 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:14,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:14,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 20:26:14,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:14,542 INFO L182 omatonBuilderFactory]: Interpolants [25504#(<= |#Ultimate.C_memset_#t~loopctr49| 8), 25505#(<= |#Ultimate.C_memset_#t~loopctr49| 9), 25506#(not (= |#Ultimate.C_memset_#amount| 119)), 25125#true, 25126#false, 25479#(not (= |zalloc_or_die_#in~size| 119)), 25480#(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)))), 25289#(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)|)), 25290#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25324#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25457#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 25495#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 25496#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 25497#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 25498#(= |#Ultimate.C_memset_#t~loopctr49| 2), 25499#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 25500#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 25501#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 25502#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 25503#(<= |#Ultimate.C_memset_#t~loopctr49| 7)] [2018-02-04 20:26:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 515 proven. 45 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:14,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 20:26:14,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 20:26:14,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-02-04 20:26:14,543 INFO L87 Difference]: Start difference. First operand 411 states and 525 transitions. Second operand 20 states. [2018-02-04 20:26:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:15,481 INFO L93 Difference]: Finished difference Result 462 states and 560 transitions. [2018-02-04 20:26:15,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:26:15,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 191 [2018-02-04 20:26:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:15,483 INFO L225 Difference]: With dead ends: 462 [2018-02-04 20:26:15,483 INFO L226 Difference]: Without dead ends: 455 [2018-02-04 20:26:15,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 20:26:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-04 20:26:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 412. [2018-02-04 20:26:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-04 20:26:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 527 transitions. [2018-02-04 20:26:15,488 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 527 transitions. Word has length 191 [2018-02-04 20:26:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:15,488 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 527 transitions. [2018-02-04 20:26:15,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 20:26:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 527 transitions. [2018-02-04 20:26:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 20:26:15,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:15,490 INFO L351 BasicCegarLoop]: trace histogram [50, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:15,490 INFO L371 AbstractCegarLoop]: === Iteration 24 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash -854283686, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:15,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 560 proven. 55 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:16,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:16,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 20:26:16,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:16,099 INFO L182 omatonBuilderFactory]: Interpolants [26784#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|)), 26785#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|)), 26786#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 26787#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6)), 26788#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 26789#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8)), 26790#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 26407#true, 26791#(and (< 9 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 26408#false, 26792#(and (<= |#Ultimate.C_memset_#amount| 10) (< 9 |#Ultimate.C_memset_#amount|)), 26763#(not (= |zalloc_or_die_#in~size| 119)), 26572#(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)|)), 26764#(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)))), 26573#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26607#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26740#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 26780#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 26781#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 26782#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 26783#(= |#Ultimate.C_memset_#t~loopctr49| 2)] [2018-02-04 20:26:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 560 proven. 55 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:16,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 20:26:16,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 20:26:16,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:26:16,100 INFO L87 Difference]: Start difference. First operand 412 states and 527 transitions. Second operand 21 states. [2018-02-04 20:26:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:17,511 INFO L93 Difference]: Finished difference Result 468 states and 567 transitions. [2018-02-04 20:26:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 20:26:17,511 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2018-02-04 20:26:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:17,512 INFO L225 Difference]: With dead ends: 468 [2018-02-04 20:26:17,513 INFO L226 Difference]: Without dead ends: 461 [2018-02-04 20:26:17,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2018-02-04 20:26:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-04 20:26:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 413. [2018-02-04 20:26:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-04 20:26:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 529 transitions. [2018-02-04 20:26:17,517 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 529 transitions. Word has length 192 [2018-02-04 20:26:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:17,517 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 529 transitions. [2018-02-04 20:26:17,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 20:26:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 529 transitions. [2018-02-04 20:26:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 20:26:17,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:17,518 INFO L351 BasicCegarLoop]: trace histogram [51, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:17,518 INFO L371 AbstractCegarLoop]: === Iteration 25 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash -826123599, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:17,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1851 backedges. 605 proven. 66 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:18,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:18,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 20:26:18,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:18,095 INFO L182 omatonBuilderFactory]: Interpolants [28068#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 28069#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 28070#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 28071#(and (= |#Ultimate.C_memset_#t~loopctr49| 2) (< 1 |#Ultimate.C_memset_#amount|)), 28072#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|) (< 1 |#Ultimate.C_memset_#amount|)), 28073#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|) (< 1 |#Ultimate.C_memset_#amount|)), 28074#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 28075#(and (<= |#Ultimate.C_memset_#t~loopctr49| 6) (< 1 |#Ultimate.C_memset_#amount|)), 27692#true, 28076#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 27693#false, 28077#(and (<= |#Ultimate.C_memset_#t~loopctr49| 8) (< 1 |#Ultimate.C_memset_#amount|)), 28078#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (< 1 |#Ultimate.C_memset_#amount|)), 28079#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 28080#(and (<= |#Ultimate.C_memset_#t~loopctr49| 11) (< 1 |#Ultimate.C_memset_#amount|)), 28081#(and (<= 0 (+ (div (+ (- 9663676119) (* (- 27) |#Ultimate.C_memset_#amount|)) 1073741824) 11)) (< 1 |#Ultimate.C_memset_#amount|)), 27858#(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)|)), 28050#(not (= |zalloc_or_die_#in~size| 119)), 27859#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28051#(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)))), 27893#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28026#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 20:26:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1851 backedges. 605 proven. 66 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:18,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 20:26:18,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 20:26:18,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-02-04 20:26:18,096 INFO L87 Difference]: Start difference. First operand 413 states and 529 transitions. Second operand 22 states. [2018-02-04 20:26:29,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:29,187 INFO L93 Difference]: Finished difference Result 471 states and 571 transitions. [2018-02-04 20:26:29,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 20:26:29,187 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2018-02-04 20:26:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:29,189 INFO L225 Difference]: With dead ends: 471 [2018-02-04 20:26:29,189 INFO L226 Difference]: Without dead ends: 464 [2018-02-04 20:26:29,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 20:26:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-04 20:26:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 414. [2018-02-04 20:26:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-04 20:26:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 531 transitions. [2018-02-04 20:26:29,193 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 531 transitions. Word has length 193 [2018-02-04 20:26:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:29,194 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 531 transitions. [2018-02-04 20:26:29,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 20:26:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 531 transitions. [2018-02-04 20:26:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-04 20:26:29,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:29,195 INFO L351 BasicCegarLoop]: trace histogram [52, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:29,195 INFO L371 AbstractCegarLoop]: === Iteration 26 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash 46839098, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:29,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 650 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:29,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:29,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 20:26:29,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:29,868 INFO L182 omatonBuilderFactory]: Interpolants [28992#false, 29376#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 29377#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6) (< 0 |#Ultimate.C_memset_#amount|)), 29378#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 29379#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8) (< 0 |#Ultimate.C_memset_#amount|)), 29380#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (< 0 |#Ultimate.C_memset_#amount|) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 29381#(and (<= 10 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 29158#(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)|)), 29382#(and (<= 11 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 11) (< 0 |#Ultimate.C_memset_#amount|)), 29159#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29383#(and (<= |#Ultimate.C_memset_#t~loopctr49| 12) (< 11 |#Ultimate.C_memset_#amount|)), 29351#(not (= |zalloc_or_die_#in~size| 119)), 29352#(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)))), 29384#(and (< 11 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 12)), 29193#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29326#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 29370#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 29371#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 29372#(and (= 1 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|)), 29373#(and (<= 2 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 2)), 29374#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|)), 28991#true, 29375#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|))] [2018-02-04 20:26:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 650 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:29,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 20:26:29,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 20:26:29,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-02-04 20:26:29,868 INFO L87 Difference]: Start difference. First operand 414 states and 531 transitions. Second operand 23 states. [2018-02-04 20:26:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:26:31,473 INFO L93 Difference]: Finished difference Result 474 states and 575 transitions. [2018-02-04 20:26:31,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 20:26:31,473 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 194 [2018-02-04 20:26:31,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:26:31,474 INFO L225 Difference]: With dead ends: 474 [2018-02-04 20:26:31,475 INFO L226 Difference]: Without dead ends: 467 [2018-02-04 20:26:31,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:26:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-04 20:26:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 415. [2018-02-04 20:26:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-02-04 20:26:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 533 transitions. [2018-02-04 20:26:31,479 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 533 transitions. Word has length 194 [2018-02-04 20:26:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:26:31,479 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 533 transitions. [2018-02-04 20:26:31,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 20:26:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 533 transitions. [2018-02-04 20:26:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-04 20:26:31,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:26:31,480 INFO L351 BasicCegarLoop]: trace histogram [53, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:26:31,480 INFO L371 AbstractCegarLoop]: === Iteration 27 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:26:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1338878929, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:26:31,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:26:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:26:37,114 WARN L143 SmtUtils]: Spent 2084ms on a formula simplification that was a NOOP. DAG size: 17 [2018-02-04 20:26:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 695 proven. 91 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:37,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:26:37,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 20:26:37,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:26:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:26:37,151 INFO L182 omatonBuilderFactory]: Interpolants [30688#(and (< 12 |#Ultimate.C_memset_#amount|) (<= (* 53 |#Ultimate.C_memset_#t~loopctr49|) (+ (div (+ (- 19327352143) (* 2147483595 |#Ultimate.C_memset_#amount|)) 2147483648) 2147484284))), 30689#(and (< 12 |#Ultimate.C_memset_#amount|) (<= (* 2147483648 |#Ultimate.C_memset_#amount|) (+ (* 2147483595 |#Ultimate.C_memset_#t~loopctr49|) (div (+ (- 19327352143) (* 2147483595 |#Ultimate.C_memset_#amount|)) 2147483648) 2147484284))), 30628#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 30674#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 30675#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 30292#true, 30676#(and (<= 1 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 1)), 30293#false, 30677#(and (<= 2 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 2)), 30678#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|)), 30679#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|)), 30680#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 30681#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6)), 30682#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 30683#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8)), 30460#(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)|)), 30684#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 30461#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30685#(and (<= 10 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 30686#(and (<= 11 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 11)), 30654#(not (= |zalloc_or_die_#in~size| 119)), 30495#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30655#(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)))), 30687#(and (<= |#Ultimate.C_memset_#t~loopctr49| 12) (<= 12 |#Ultimate.C_memset_#t~loopctr49|))] [2018-02-04 20:26:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 695 proven. 91 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:26:37,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 20:26:37,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 20:26:37,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=503, Unknown=1, NotChecked=0, Total=552 [2018-02-04 20:26:37,152 INFO L87 Difference]: Start difference. First operand 415 states and 533 transitions. Second operand 24 states. [2018-02-04 20:27:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:27:07,351 INFO L93 Difference]: Finished difference Result 477 states and 579 transitions. [2018-02-04 20:27:07,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:27:07,351 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 195 [2018-02-04 20:27:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:27:07,352 INFO L225 Difference]: With dead ends: 477 [2018-02-04 20:27:07,352 INFO L226 Difference]: Without dead ends: 470 [2018-02-04 20:27:07,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=99, Invalid=955, Unknown=2, NotChecked=0, Total=1056 [2018-02-04 20:27:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-04 20:27:07,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 416. [2018-02-04 20:27:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-02-04 20:27:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 535 transitions. [2018-02-04 20:27:07,356 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 535 transitions. Word has length 195 [2018-02-04 20:27:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:27:07,356 INFO L432 AbstractCegarLoop]: Abstraction has 416 states and 535 transitions. [2018-02-04 20:27:07,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 20:27:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 535 transitions. [2018-02-04 20:27:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-04 20:27:07,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:27:07,357 INFO L351 BasicCegarLoop]: trace histogram [54, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:27:07,357 INFO L371 AbstractCegarLoop]: === Iteration 28 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:27:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1557559270, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:27:07,359 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:27:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:27:13,442 WARN L1033 $PredicateComparison]: unable to prove that (and (< 13 |c_#Ultimate.C_memset_#amount|) (<= (* 4294967296 |c_#Ultimate.C_memset_#amount|) (+ (* 4294967191 |c_#Ultimate.C_memset_#t~loopctr49|) (div (+ (- 47244638786) (* 4294967191 |c_#Ultimate.C_memset_#amount|)) 4294967296) 4294968661))) is different from true [2018-02-04 20:27:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 740 proven. 105 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:27:13,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:27:13,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 20:27:13,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:27:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:27:13,479 INFO L182 omatonBuilderFactory]: Interpolants [32000#(and (<= 13 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 13)), 32001#(and (< 13 |#Ultimate.C_memset_#amount|) (<= (* 105 |#Ultimate.C_memset_#t~loopctr49|) (+ (div (+ (- 47244638786) (* 4294967191 |#Ultimate.C_memset_#amount|)) 4294967296) 4294968661))), 31938#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 32002#(and (< 13 |#Ultimate.C_memset_#amount|) (<= (* 4294967296 |#Ultimate.C_memset_#amount|) (+ (* 4294967191 |#Ultimate.C_memset_#t~loopctr49|) (div (+ (- 47244638786) (* 4294967191 |#Ultimate.C_memset_#amount|)) 4294967296) 4294968661))), 31770#(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)|)), 31771#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 31965#(not (= |zalloc_or_die_#in~size| 119)), 31966#(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)))), 31601#true, 31602#false, 31986#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 31987#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 31988#(and (<= 1 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 1)), 31989#(and (<= 2 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 2)), 31990#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|)), 31991#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|)), 31992#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 31993#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6)), 31994#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 31995#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8)), 31996#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 31805#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 31997#(and (<= 10 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 31998#(and (<= 11 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 11)), 31999#(and (<= |#Ultimate.C_memset_#t~loopctr49| 12) (<= 12 |#Ultimate.C_memset_#t~loopctr49|))] [2018-02-04 20:27:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 740 proven. 105 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:27:13,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 20:27:13,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 20:27:13,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=504, Unknown=2, NotChecked=44, Total=600 [2018-02-04 20:27:13,480 INFO L87 Difference]: Start difference. First operand 416 states and 535 transitions. Second operand 25 states. [2018-02-04 20:27:18,678 WARN L143 SmtUtils]: Spent 2095ms on a formula simplification that was a NOOP. DAG size: 21 [2018-02-04 20:28:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:28:24,588 INFO L93 Difference]: Finished difference Result 480 states and 583 transitions. [2018-02-04 20:28:24,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 20:28:24,588 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 196 [2018-02-04 20:28:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:28:24,590 INFO L225 Difference]: With dead ends: 480 [2018-02-04 20:28:24,590 INFO L226 Difference]: Without dead ends: 473 [2018-02-04 20:28:24,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=100, Invalid=958, Unknown=2, NotChecked=62, Total=1122 [2018-02-04 20:28:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-04 20:28:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 417. [2018-02-04 20:28:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-02-04 20:28:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 537 transitions. [2018-02-04 20:28:24,594 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 537 transitions. Word has length 196 [2018-02-04 20:28:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:28:24,594 INFO L432 AbstractCegarLoop]: Abstraction has 417 states and 537 transitions. [2018-02-04 20:28:24,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 20:28:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 537 transitions. [2018-02-04 20:28:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 20:28:24,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:28:24,595 INFO L351 BasicCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:28:24,595 INFO L371 AbstractCegarLoop]: === Iteration 29 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:28:24,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1152830223, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:28:24,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:28:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:28:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2085 backedges. 785 proven. 120 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:28:28,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:28:28,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 20:28:28,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:28:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:28:28,250 INFO L182 omatonBuilderFactory]: Interpolants [33088#(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)|)), 33089#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 33284#(not (= |zalloc_or_die_#in~size| 119)), 33285#(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)))), 32918#true, 32919#false, 33306#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 33307#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 33308#(and (<= 1 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 1)), 33309#(and (<= 2 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 2)), 33310#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|)), 33311#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|)), 33312#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 33313#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6)), 33314#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 33123#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 33315#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8)), 33316#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 33317#(and (<= 10 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 33318#(and (<= 11 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 11)), 33319#(and (<= |#Ultimate.C_memset_#t~loopctr49| 12) (<= 12 |#Ultimate.C_memset_#t~loopctr49|)), 33256#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 33320#(and (<= 13 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 13)), 33321#(and (<= 14 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 14)), 33322#(and (<= (* 13 |#Ultimate.C_memset_#t~loopctr49|) (+ (div (+ (- 6442450749) (* 536870899 |#Ultimate.C_memset_#amount|)) 536870912) 536871094)) (< 14 |#Ultimate.C_memset_#amount|)), 33323#(and (<= (* 536870912 |#Ultimate.C_memset_#amount|) (+ (* 536870899 |#Ultimate.C_memset_#t~loopctr49|) (div (+ (- 6442450749) (* 536870899 |#Ultimate.C_memset_#amount|)) 536870912) 536871094)) (< 14 |#Ultimate.C_memset_#amount|))] [2018-02-04 20:28:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2085 backedges. 785 proven. 120 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:28:28,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 20:28:28,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 20:28:28,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=597, Unknown=1, NotChecked=0, Total=650 [2018-02-04 20:28:28,251 INFO L87 Difference]: Start difference. First operand 417 states and 537 transitions. Second operand 26 states. [2018-02-04 20:28:54,168 WARN L143 SmtUtils]: Spent 6388ms on a formula simplification that was a NOOP. DAG size: 21 Received shutdown request... [2018-02-04 20:29:20,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 20:29:20,127 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 20:29:20,133 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 20:29:20,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 08:29:20 BoogieIcfgContainer [2018-02-04 20:29:20,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 20:29:20,134 INFO L168 Benchmark]: Toolchain (without parser) took 215488.94 ms. Allocated memory was 402.7 MB in the beginning and 1.0 GB in the end (delta: 610.3 MB). Free memory was 359.5 MB in the beginning and 845.8 MB in the end (delta: -486.2 MB). Peak memory consumption was 124.0 MB. Max. memory is 5.3 GB. [2018-02-04 20:29:20,135 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 20:29:20,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.36 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 346.2 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-04 20:29:20,136 INFO L168 Benchmark]: Boogie Preprocessor took 36.37 ms. Allocated memory is still 402.7 MB. Free memory was 346.2 MB in the beginning and 344.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 20:29:20,136 INFO L168 Benchmark]: RCFGBuilder took 557.97 ms. Allocated memory is still 402.7 MB. Free memory was 344.9 MB in the beginning and 283.8 MB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 5.3 GB. [2018-02-04 20:29:20,136 INFO L168 Benchmark]: TraceAbstraction took 214711.99 ms. Allocated memory was 402.7 MB in the beginning and 1.0 GB in the end (delta: 610.3 MB). Free memory was 283.8 MB in the beginning and 845.8 MB in the end (delta: -562.0 MB). Peak memory consumption was 48.3 MB. Max. memory is 5.3 GB. [2018-02-04 20:29:20,138 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.12 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 179.36 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 346.2 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.37 ms. Allocated memory is still 402.7 MB. Free memory was 346.2 MB in the beginning and 344.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 557.97 ms. Allocated memory is still 402.7 MB. Free memory was 344.9 MB in the beginning and 283.8 MB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 214711.99 ms. Allocated memory was 402.7 MB in the beginning and 1.0 GB in the end (delta: 610.3 MB). Free memory was 283.8 MB in the beginning and 845.8 MB in the end (delta: -562.0 MB). Peak memory consumption was 48.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (417states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 275 locations, 85 error locations. TIMEOUT Result, 214.6s OverallTime, 29 OverallIterations, 55 TraceHistogramMax, 190.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7014 SDtfs, 6845 SDslu, 51711 SDs, 0 SdLazy, 56433 SolverSat, 1825 SolverUnsat, 68 SolverUnknown, 0 SolverNotchecked, 162.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1586 GetRequests, 913 SyntacticMatches, 0 SemanticMatches, 673 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 37.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 30020/31970 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 1321 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 4415 NumberOfCodeBlocks, 4415 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4386 ConstructedInterpolants, 8 QuantifiedInterpolants, 2342905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 30020/31970 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_20-29-20-148.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_20-29-20-148.csv Completed graceful shutdown