./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:46,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:46,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:46,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:46,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:46,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:46,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:46,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:46,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:46,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:46,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:46,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:46,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:46,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:46,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:46,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:46,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:46,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:46,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:46,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:46,718 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:46,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:46,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:46,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:46,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:46,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:46,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:46,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:46,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:46,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:46,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:46,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:46,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:46,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:46,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:46,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:46,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:46,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:46,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:46,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:46,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:46,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:46,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-14 05:50:46,757 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:46,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:46,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:46,758 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:46,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:46,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:46,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:46,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:46,759 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:46,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:46,760 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:46,760 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:46,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:46,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:46,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:46,761 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:46,761 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:46,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:46,761 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:46,762 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:46,762 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:46,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:46,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:46,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:46,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:46,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:46,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:46,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:50:46,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:50:46,764 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 [2022-07-14 05:50:46,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:46,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:46,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:46,979 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:46,981 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:46,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2022-07-14 05:50:47,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493ff4d0f/28ed60629247460e934217b770a8384f/FLAGb0e51a6d6 [2022-07-14 05:50:47,475 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:47,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2022-07-14 05:50:47,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493ff4d0f/28ed60629247460e934217b770a8384f/FLAGb0e51a6d6 [2022-07-14 05:50:47,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493ff4d0f/28ed60629247460e934217b770a8384f [2022-07-14 05:50:47,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:47,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:47,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:47,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:47,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:47,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:47" (1/1) ... [2022-07-14 05:50:47,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a5d724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:47, skipping insertion in model container [2022-07-14 05:50:47,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:47" (1/1) ... [2022-07-14 05:50:47,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:47,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:48,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2022-07-14 05:50:48,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:48,088 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:50:48,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2022-07-14 05:50:48,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:48,159 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:50:48,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48 WrapperNode [2022-07-14 05:50:48,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:48,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:48,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:50:48,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:50:48,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (1/1) ... [2022-07-14 05:50:48,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (1/1) ... [2022-07-14 05:50:48,210 INFO L137 Inliner]: procedures = 123, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-07-14 05:50:48,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:48,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:50:48,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:50:48,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:50:48,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (1/1) ... [2022-07-14 05:50:48,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (1/1) ... [2022-07-14 05:50:48,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (1/1) ... [2022-07-14 05:50:48,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (1/1) ... [2022-07-14 05:50:48,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (1/1) ... [2022-07-14 05:50:48,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (1/1) ... [2022-07-14 05:50:48,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (1/1) ... [2022-07-14 05:50:48,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:50:48,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:50:48,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:50:48,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:50:48,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (1/1) ... [2022-07-14 05:50:48,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:48,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:48,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 05:50:48,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 05:50:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 05:50:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 05:50:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:50:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:50:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:50:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:50:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:50:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 05:50:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:50:48,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:50:48,357 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:50:48,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:50:48,573 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:50:48,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:50:48,583 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 05:50:48,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:48 BoogieIcfgContainer [2022-07-14 05:50:48,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:50:48,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:50:48,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:50:48,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:50:48,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:50:47" (1/3) ... [2022-07-14 05:50:48,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746bdfff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:48, skipping insertion in model container [2022-07-14 05:50:48,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:48" (2/3) ... [2022-07-14 05:50:48,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746bdfff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:48, skipping insertion in model container [2022-07-14 05:50:48,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:48" (3/3) ... [2022-07-14 05:50:48,601 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2022-07-14 05:50:48,617 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:50:48,617 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-07-14 05:50:48,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:50:48,672 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40b0f8a0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a2274dd [2022-07-14 05:50:48,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-07-14 05:50:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 05:50:48,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:48,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 05:50:48,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2022-07-14 05:50:48,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:48,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722421347] [2022-07-14 05:50:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:48,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722421347] [2022-07-14 05:50:48,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722421347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:48,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:48,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:48,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496948744] [2022-07-14 05:50:48,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:48,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:48,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:48,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:48,880 INFO L87 Difference]: Start difference. First operand has 88 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:48,993 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2022-07-14 05:50:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:48,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 05:50:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:49,003 INFO L225 Difference]: With dead ends: 144 [2022-07-14 05:50:49,003 INFO L226 Difference]: Without dead ends: 139 [2022-07-14 05:50:49,004 INFO L412 NwaCegarLoop]: 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 [2022-07-14 05:50:49,006 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 88 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:49,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 168 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:49,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-14 05:50:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 80. [2022-07-14 05:50:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.78) internal successors, (89), 79 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-07-14 05:50:49,035 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2022-07-14 05:50:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:49,036 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-07-14 05:50:49,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-07-14 05:50:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 05:50:49,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:49,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 05:50:49,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 05:50:49,038 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2022-07-14 05:50:49,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:49,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41591666] [2022-07-14 05:50:49,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:49,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41591666] [2022-07-14 05:50:49,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41591666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:49,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:49,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:49,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039519627] [2022-07-14 05:50:49,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:49,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:49,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:49,106 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:49,181 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-07-14 05:50:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 05:50:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:49,185 INFO L225 Difference]: With dead ends: 134 [2022-07-14 05:50:49,185 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 05:50:49,188 INFO L412 NwaCegarLoop]: 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 [2022-07-14 05:50:49,190 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 80 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:49,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 05:50:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 75. [2022-07-14 05:50:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.68) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-07-14 05:50:49,201 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 5 [2022-07-14 05:50:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:49,201 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-07-14 05:50:49,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-07-14 05:50:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:50:49,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:49,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:50:49,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 05:50:49,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash 889673528, now seen corresponding path program 1 times [2022-07-14 05:50:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:49,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512231588] [2022-07-14 05:50:49,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:49,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:49,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512231588] [2022-07-14 05:50:49,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512231588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:49,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:49,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:49,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739166980] [2022-07-14 05:50:49,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:49,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:49,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:49,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:49,246 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:49,258 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-07-14 05:50:49,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:49,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 05:50:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:49,259 INFO L225 Difference]: With dead ends: 90 [2022-07-14 05:50:49,260 INFO L226 Difference]: Without dead ends: 90 [2022-07-14 05:50:49,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:49,262 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:49,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 158 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-14 05:50:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2022-07-14 05:50:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-07-14 05:50:49,274 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 6 [2022-07-14 05:50:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:49,274 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-07-14 05:50:49,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-07-14 05:50:49,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:50:49,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:49,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:49,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 05:50:49,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1959623991, now seen corresponding path program 1 times [2022-07-14 05:50:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:49,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470203010] [2022-07-14 05:50:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:49,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:49,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:49,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470203010] [2022-07-14 05:50:49,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470203010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:49,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:49,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:49,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160724325] [2022-07-14 05:50:49,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:49,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:49,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:49,338 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:49,348 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2022-07-14 05:50:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:49,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 05:50:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:49,349 INFO L225 Difference]: With dead ends: 87 [2022-07-14 05:50:49,349 INFO L226 Difference]: Without dead ends: 87 [2022-07-14 05:50:49,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:49,350 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:49,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 157 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-14 05:50:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-07-14 05:50:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-07-14 05:50:49,354 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 14 [2022-07-14 05:50:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:49,355 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-07-14 05:50:49,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-07-14 05:50:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 05:50:49,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:49,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:49,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 05:50:49,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:49,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:49,365 INFO L85 PathProgramCache]: Analyzing trace with hash 866232140, now seen corresponding path program 1 times [2022-07-14 05:50:49,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:49,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291689811] [2022-07-14 05:50:49,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:49,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:49,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291689811] [2022-07-14 05:50:49,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291689811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:49,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967781777] [2022-07-14 05:50:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:49,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:49,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:49,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:49,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 05:50:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:49,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 05:50:49,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:49,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:49,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967781777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:49,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:49,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-14 05:50:49,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390958502] [2022-07-14 05:50:49,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:49,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:49,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:49,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:49,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:49,547 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:49,567 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-07-14 05:50:49,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:49,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 05:50:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:49,569 INFO L225 Difference]: With dead ends: 118 [2022-07-14 05:50:49,569 INFO L226 Difference]: Without dead ends: 118 [2022-07-14 05:50:49,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:49,570 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 66 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:49,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 249 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-14 05:50:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2022-07-14 05:50:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2022-07-14 05:50:49,574 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 18 [2022-07-14 05:50:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:49,574 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2022-07-14 05:50:49,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2022-07-14 05:50:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 05:50:49,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:49,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:49,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:49,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:49,788 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash 829454667, now seen corresponding path program 1 times [2022-07-14 05:50:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:49,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529558066] [2022-07-14 05:50:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:49,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529558066] [2022-07-14 05:50:49,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529558066] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:49,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017458119] [2022-07-14 05:50:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:49,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:49,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:49,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 05:50:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:50,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 05:50:50,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:50,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:50,119 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:50:50,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:50:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:50,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:50,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017458119] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:50,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:50,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-14 05:50:50,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825700749] [2022-07-14 05:50:50,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:50,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:50,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:50,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:50,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:50,271 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:50,350 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2022-07-14 05:50:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:50:50,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 05:50:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:50,351 INFO L225 Difference]: With dead ends: 145 [2022-07-14 05:50:50,352 INFO L226 Difference]: Without dead ends: 145 [2022-07-14 05:50:50,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:50,353 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 156 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:50,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 182 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-07-14 05:50:50,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-14 05:50:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 113. [2022-07-14 05:50:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 89 states have (on average 1.449438202247191) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2022-07-14 05:50:50,360 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 26 [2022-07-14 05:50:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:50,360 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2022-07-14 05:50:50,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2022-07-14 05:50:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 05:50:50,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:50,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:50,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:50,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-14 05:50:50,577 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 829454668, now seen corresponding path program 1 times [2022-07-14 05:50:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:50,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060212820] [2022-07-14 05:50:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:50,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:50,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060212820] [2022-07-14 05:50:50,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060212820] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:50,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657861538] [2022-07-14 05:50:50,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:50,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:50,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:50,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:50,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 05:50:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:50,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 05:50:50,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:50,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:50,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:50,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 05:50:50,836 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:50,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 05:50:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:50,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:51,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-14 05:50:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:51,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657861538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:51,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:51,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-14 05:50:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357489901] [2022-07-14 05:50:51,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:51,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 05:50:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 05:50:51,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:50:51,116 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:51,228 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2022-07-14 05:50:51,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:51,229 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 05:50:51,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:51,230 INFO L225 Difference]: With dead ends: 147 [2022-07-14 05:50:51,231 INFO L226 Difference]: Without dead ends: 147 [2022-07-14 05:50:51,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-07-14 05:50:51,232 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 628 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:51,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 100 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2022-07-14 05:50:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-14 05:50:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 112. [2022-07-14 05:50:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-07-14 05:50:51,252 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 26 [2022-07-14 05:50:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:51,256 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-07-14 05:50:51,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-07-14 05:50:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 05:50:51,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:51,258 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:51,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:51,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:51,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:51,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:51,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1598053496, now seen corresponding path program 2 times [2022-07-14 05:50:51,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:51,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059821326] [2022-07-14 05:50:51,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 05:50:51,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:51,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059821326] [2022-07-14 05:50:51,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059821326] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:51,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654330961] [2022-07-14 05:50:51,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:50:51,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:51,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:51,540 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:51,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 05:50:51,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:50:51,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:50:51,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 05:50:51,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:51,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:51,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654330961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:51,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:51,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2022-07-14 05:50:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595215090] [2022-07-14 05:50:51,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:51,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:50:51,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:51,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:50:51,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:51,800 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:51,902 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2022-07-14 05:50:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:50:51,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-14 05:50:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:51,903 INFO L225 Difference]: With dead ends: 125 [2022-07-14 05:50:51,903 INFO L226 Difference]: Without dead ends: 125 [2022-07-14 05:50:51,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-07-14 05:50:51,903 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 219 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:51,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 275 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-14 05:50:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-14 05:50:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2022-07-14 05:50:51,906 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 54 [2022-07-14 05:50:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:51,906 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2022-07-14 05:50:51,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2022-07-14 05:50:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 05:50:51,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:51,907 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:51,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:52,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:52,108 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:52,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1121714636, now seen corresponding path program 1 times [2022-07-14 05:50:52,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:52,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535396676] [2022-07-14 05:50:52,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:52,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-14 05:50:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:52,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535396676] [2022-07-14 05:50:52,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535396676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:52,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:52,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973378777] [2022-07-14 05:50:52,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:52,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:52,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:52,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:52,215 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:52,354 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2022-07-14 05:50:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:52,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-07-14 05:50:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:52,355 INFO L225 Difference]: With dead ends: 171 [2022-07-14 05:50:52,356 INFO L226 Difference]: Without dead ends: 171 [2022-07-14 05:50:52,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:52,356 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 410 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:52,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 91 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:52,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-14 05:50:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2022-07-14 05:50:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 181 transitions. [2022-07-14 05:50:52,359 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 181 transitions. Word has length 70 [2022-07-14 05:50:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:52,360 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 181 transitions. [2022-07-14 05:50:52,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 181 transitions. [2022-07-14 05:50:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 05:50:52,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:52,361 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:52,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 05:50:52,361 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:52,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1121714635, now seen corresponding path program 1 times [2022-07-14 05:50:52,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:52,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733204844] [2022-07-14 05:50:52,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:52,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-14 05:50:52,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:52,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733204844] [2022-07-14 05:50:52,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733204844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:52,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:52,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:52,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067015910] [2022-07-14 05:50:52,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:52,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:52,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:52,448 INFO L87 Difference]: Start difference. First operand 152 states and 181 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:52,554 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2022-07-14 05:50:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:52,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-07-14 05:50:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:52,557 INFO L225 Difference]: With dead ends: 171 [2022-07-14 05:50:52,557 INFO L226 Difference]: Without dead ends: 171 [2022-07-14 05:50:52,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:52,558 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 252 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:52,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 122 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-14 05:50:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2022-07-14 05:50:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.282442748091603) internal successors, (168), 145 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 168 transitions. [2022-07-14 05:50:52,562 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 168 transitions. Word has length 70 [2022-07-14 05:50:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:52,563 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 168 transitions. [2022-07-14 05:50:52,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2022-07-14 05:50:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-14 05:50:52,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:52,566 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:52,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 05:50:52,567 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1909311012, now seen corresponding path program 1 times [2022-07-14 05:50:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:52,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292626790] [2022-07-14 05:50:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:52,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-14 05:50:52,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:52,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292626790] [2022-07-14 05:50:52,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292626790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:52,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:52,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:52,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879410833] [2022-07-14 05:50:52,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:52,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:52,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:52,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:52,652 INFO L87 Difference]: Start difference. First operand 146 states and 168 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:52,732 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2022-07-14 05:50:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:52,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-14 05:50:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:52,734 INFO L225 Difference]: With dead ends: 152 [2022-07-14 05:50:52,734 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 05:50:52,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:52,735 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 333 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:52,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 116 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 05:50:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2022-07-14 05:50:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 145 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2022-07-14 05:50:52,739 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 74 [2022-07-14 05:50:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:52,739 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2022-07-14 05:50:52,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2022-07-14 05:50:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-14 05:50:52,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:52,740 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:52,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 05:50:52,741 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -522705552, now seen corresponding path program 1 times [2022-07-14 05:50:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:52,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71500419] [2022-07-14 05:50:52,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:52,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-14 05:50:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:52,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71500419] [2022-07-14 05:50:52,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71500419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:52,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752259022] [2022-07-14 05:50:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:52,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:52,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:52,914 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:52,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 05:50:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:53,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 05:50:53,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:53,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:53,102 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:53,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 05:50:53,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:53,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 05:50:53,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-14 05:50:53,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-14 05:50:53,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-14 05:50:53,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-14 05:50:53,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:53,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-07-14 05:50:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-14 05:50:53,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:53,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-14 05:50:53,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1546 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-14 05:50:53,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1545 Int) (v_ArrVal_1546 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1545) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-14 05:50:53,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1545 Int) (v_ArrVal_1546 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1543) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1545) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-14 05:50:53,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1545 Int) (v_ArrVal_1546 Int)) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1543) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1545) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2022-07-14 05:50:53,487 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-14 05:50:53,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 59 [2022-07-14 05:50:53,491 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 05:50:53,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2022-07-14 05:50:53,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 05:50:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 9 not checked. [2022-07-14 05:50:53,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752259022] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:53,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 26 [2022-07-14 05:50:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842904166] [2022-07-14 05:50:53,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:53,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 05:50:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:53,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 05:50:53,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=367, Unknown=5, NotChecked=210, Total=650 [2022-07-14 05:50:53,528 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:54,182 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2022-07-14 05:50:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 05:50:54,183 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-14 05:50:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:54,184 INFO L225 Difference]: With dead ends: 185 [2022-07-14 05:50:54,184 INFO L226 Difference]: Without dead ends: 185 [2022-07-14 05:50:54,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=395, Invalid=1260, Unknown=5, NotChecked=410, Total=2070 [2022-07-14 05:50:54,185 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 638 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 511 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:54,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 560 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 491 Invalid, 0 Unknown, 511 Unchecked, 0.2s Time] [2022-07-14 05:50:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-14 05:50:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 146. [2022-07-14 05:50:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 145 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2022-07-14 05:50:54,187 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 78 [2022-07-14 05:50:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:54,187 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2022-07-14 05:50:54,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2022-07-14 05:50:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-14 05:50:54,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:54,188 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:54,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:54,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-14 05:50:54,395 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:54,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:54,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1817927893, now seen corresponding path program 1 times [2022-07-14 05:50:54,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:54,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282642934] [2022-07-14 05:50:54,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:54,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 65 proven. 44 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-14 05:50:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:54,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282642934] [2022-07-14 05:50:54,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282642934] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:54,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119052924] [2022-07-14 05:50:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:54,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:54,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:54,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:54,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 05:50:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:54,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-14 05:50:54,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:54,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:54,834 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:54,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 05:50:54,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:50:54,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:54,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 05:50:54,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:54,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 05:50:54,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:54,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 05:50:54,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:50:55,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:50:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-14 05:50:55,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:55,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:55,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:55,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:55,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:55,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 43 [2022-07-14 05:50:55,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 05:50:55,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 05:50:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-14 05:50:55,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119052924] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:55,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:55,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 31 [2022-07-14 05:50:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515068419] [2022-07-14 05:50:55,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:55,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 05:50:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:55,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 05:50:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=819, Unknown=5, NotChecked=0, Total=930 [2022-07-14 05:50:55,319 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:55,737 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2022-07-14 05:50:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 05:50:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-07-14 05:50:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:55,739 INFO L225 Difference]: With dead ends: 177 [2022-07-14 05:50:55,739 INFO L226 Difference]: Without dead ends: 177 [2022-07-14 05:50:55,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=366, Invalid=1521, Unknown=5, NotChecked=0, Total=1892 [2022-07-14 05:50:55,740 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 771 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:55,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 516 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 477 Invalid, 0 Unknown, 14 Unchecked, 0.2s Time] [2022-07-14 05:50:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-14 05:50:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 146. [2022-07-14 05:50:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 145 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 165 transitions. [2022-07-14 05:50:55,742 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 165 transitions. Word has length 80 [2022-07-14 05:50:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:55,742 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 165 transitions. [2022-07-14 05:50:55,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 165 transitions. [2022-07-14 05:50:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-14 05:50:55,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:55,743 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:55,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:55,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:55,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:55,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:55,944 INFO L85 PathProgramCache]: Analyzing trace with hash 182605743, now seen corresponding path program 1 times [2022-07-14 05:50:55,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:55,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207478265] [2022-07-14 05:50:55,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:55,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-14 05:50:56,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:56,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207478265] [2022-07-14 05:50:56,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207478265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:56,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584402648] [2022-07-14 05:50:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:56,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:56,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:56,088 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:56,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 05:50:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:56,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-14 05:50:56,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:56,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:56,349 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:56,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 05:50:56,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 05:50:56,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:56,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 05:50:56,418 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:56,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-14 05:50:56,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:56,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2022-07-14 05:50:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-14 05:50:56,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:56,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2304 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_34| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2304) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0))))) is different from false [2022-07-14 05:50:56,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2304 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_34| Int) (v_ArrVal_2301 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2301)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2304) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)))) is different from false [2022-07-14 05:50:56,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:56,736 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:56,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-14 05:50:56,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:56,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2022-07-14 05:50:56,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-07-14 05:50:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 3 not checked. [2022-07-14 05:50:57,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584402648] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:57,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:57,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2022-07-14 05:50:57,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784810449] [2022-07-14 05:50:57,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:57,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 05:50:57,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:57,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 05:50:57,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=794, Unknown=2, NotChecked=114, Total=992 [2022-07-14 05:50:57,016 INFO L87 Difference]: Start difference. First operand 146 states and 165 transitions. Second operand has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:57,473 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2304 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_34| Int) (v_ArrVal_2301 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2301)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2304) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-14 05:50:57,956 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (forall ((v_ArrVal_2304 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_34| Int) (v_ArrVal_2301 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2301)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2304) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2022-07-14 05:50:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:58,302 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2022-07-14 05:50:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 05:50:58,303 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-07-14 05:50:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:58,304 INFO L225 Difference]: With dead ends: 164 [2022-07-14 05:50:58,304 INFO L226 Difference]: Without dead ends: 160 [2022-07-14 05:50:58,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=346, Invalid=1922, Unknown=4, NotChecked=380, Total=2652 [2022-07-14 05:50:58,305 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 574 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 366 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:58,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 783 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 505 Invalid, 0 Unknown, 366 Unchecked, 0.3s Time] [2022-07-14 05:50:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-14 05:50:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2022-07-14 05:50:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 131 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2022-07-14 05:50:58,308 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 81 [2022-07-14 05:50:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:58,308 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2022-07-14 05:50:58,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2022-07-14 05:50:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 05:50:58,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:58,309 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:58,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:58,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:58,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-07-14 05:50:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1021407014, now seen corresponding path program 1 times [2022-07-14 05:50:58,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:58,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196964312] [2022-07-14 05:50:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 05:50:58,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 05:50:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 05:50:58,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 05:50:58,633 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 05:50:58,634 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (34 of 35 remaining) [2022-07-14 05:50:58,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 35 remaining) [2022-07-14 05:50:58,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 35 remaining) [2022-07-14 05:50:58,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 35 remaining) [2022-07-14 05:50:58,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 35 remaining) [2022-07-14 05:50:58,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 35 remaining) [2022-07-14 05:50:58,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 35 remaining) [2022-07-14 05:50:58,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 35 remaining) [2022-07-14 05:50:58,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 35 remaining) [2022-07-14 05:50:58,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 35 remaining) [2022-07-14 05:50:58,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 35 remaining) [2022-07-14 05:50:58,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 35 remaining) [2022-07-14 05:50:58,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 35 remaining) [2022-07-14 05:50:58,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 35 remaining) [2022-07-14 05:50:58,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 35 remaining) [2022-07-14 05:50:58,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 35 remaining) [2022-07-14 05:50:58,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 35 remaining) [2022-07-14 05:50:58,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 35 remaining) [2022-07-14 05:50:58,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 35 remaining) [2022-07-14 05:50:58,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 35 remaining) [2022-07-14 05:50:58,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 35 remaining) [2022-07-14 05:50:58,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 35 remaining) [2022-07-14 05:50:58,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 35 remaining) [2022-07-14 05:50:58,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 35 remaining) [2022-07-14 05:50:58,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 35 remaining) [2022-07-14 05:50:58,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 35 remaining) [2022-07-14 05:50:58,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 35 remaining) [2022-07-14 05:50:58,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 35 remaining) [2022-07-14 05:50:58,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 35 remaining) [2022-07-14 05:50:58,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 35 remaining) [2022-07-14 05:50:58,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 35 remaining) [2022-07-14 05:50:58,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (3 of 35 remaining) [2022-07-14 05:50:58,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (2 of 35 remaining) [2022-07-14 05:50:58,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (1 of 35 remaining) [2022-07-14 05:50:58,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (0 of 35 remaining) [2022-07-14 05:50:58,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 05:50:58,642 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:58,645 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 05:50:58,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 05:50:58 BoogieIcfgContainer [2022-07-14 05:50:58,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 05:50:58,696 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 05:50:58,696 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 05:50:58,697 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 05:50:58,697 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:48" (3/4) ... [2022-07-14 05:50:58,698 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-14 05:50:58,750 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 05:50:58,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 05:50:58,751 INFO L158 Benchmark]: Toolchain (without parser) took 10902.02ms. Allocated memory was 96.5MB in the beginning and 211.8MB in the end (delta: 115.3MB). Free memory was 64.3MB in the beginning and 183.6MB in the end (delta: -119.3MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. [2022-07-14 05:50:58,751 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 96.5MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:50:58,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.42ms. Allocated memory is still 96.5MB. Free memory was 64.1MB in the beginning and 64.1MB in the end (delta: -50.0kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 05:50:58,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.70ms. Allocated memory is still 96.5MB. Free memory was 64.1MB in the beginning and 62.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:58,752 INFO L158 Benchmark]: Boogie Preprocessor took 36.74ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 60.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:58,752 INFO L158 Benchmark]: RCFGBuilder took 345.88ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 60.3MB in the beginning and 123.1MB in the end (delta: -62.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2022-07-14 05:50:58,753 INFO L158 Benchmark]: TraceAbstraction took 10100.64ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 122.5MB in the beginning and 67.5MB in the end (delta: 55.0MB). Peak memory consumption was 118.7MB. Max. memory is 16.1GB. [2022-07-14 05:50:58,753 INFO L158 Benchmark]: Witness Printer took 54.16ms. Allocated memory is still 211.8MB. Free memory was 67.5MB in the beginning and 183.6MB in the end (delta: -116.1MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-07-14 05:50:58,756 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 96.5MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.42ms. Allocated memory is still 96.5MB. Free memory was 64.1MB in the beginning and 64.1MB in the end (delta: -50.0kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.70ms. Allocated memory is still 96.5MB. Free memory was 64.1MB in the beginning and 62.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.74ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 60.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.88ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 60.3MB in the beginning and 123.1MB in the end (delta: -62.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10100.64ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 122.5MB in the beginning and 67.5MB in the end (delta: 55.0MB). Peak memory consumption was 118.7MB. Max. memory is 16.1GB. * Witness Printer took 54.16ms. Allocated memory is still 211.8MB. Free memory was 67.5MB in the beginning and 183.6MB in the end (delta: -116.1MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 616]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-1:0}] [L588] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, new_head={-2:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, new_head={-3:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, new_head={-4:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, new_head={-5:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, new_head={-5:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, len=5] [L602] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() VAL [head={-5:0}, len=5] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4233 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4233 mSDsluCounter, 3646 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 996 IncrementalHoareTripleChecker+Unchecked, 2676 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2293 IncrementalHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 970 mSDtfsCounter, 2293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 904 GetRequests, 701 SyntacticMatches, 7 SemanticMatches, 196 ConstructedPredicates, 9 IntricatePredicates, 3 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=9, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 352 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1305 ConstructedInterpolants, 61 QuantifiedInterpolants, 6447 SizeOfPredicates, 50 NumberOfNonLiveVariables, 3161 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 1502/1869 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-14 05:50:58,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)