./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:13:32,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:13:32,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:13:32,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:13:32,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:13:32,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:13:32,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:13:32,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:13:32,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:13:32,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:13:32,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:13:32,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:13:32,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:13:32,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:13:32,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:13:32,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:13:32,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:13:32,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:13:32,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:13:32,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:13:32,297 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:13:32,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:13:32,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:13:32,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:13:32,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:13:32,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:13:32,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:13:32,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:13:32,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:13:32,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:13:32,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:13:32,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:13:32,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:13:32,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:13:32,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:13:32,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:13:32,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:13:32,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:13:32,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:13:32,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:13:32,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:13:32,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:13:32,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:13:32,354 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:13:32,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:13:32,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:13:32,356 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:13:32,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:13:32,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:13:32,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:13:32,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:13:32,358 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:13:32,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:13:32,359 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:13:32,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:13:32,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:13:32,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:13:32,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:13:32,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:13:32,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:13:32,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:13:32,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:13:32,360 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:13:32,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:13:32,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:13:32,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:13:32,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:13:32,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:13:32,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:13:32,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:13:32,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:13:32,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:13:32,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:13:32,363 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:13:32,363 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:13:32,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:13:32,363 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 ! call(reach_error())) ) 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2022-07-21 02:13:32,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:13:32,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:13:32,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:13:32,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:13:32,742 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:13:32,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-07-21 02:13:32,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4cba8af/18d11f67c9654b62b9251033dd66f8f0/FLAG428c97dfd [2022-07-21 02:13:33,326 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:13:33,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-07-21 02:13:33,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4cba8af/18d11f67c9654b62b9251033dd66f8f0/FLAG428c97dfd [2022-07-21 02:13:33,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4cba8af/18d11f67c9654b62b9251033dd66f8f0 [2022-07-21 02:13:33,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:13:33,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:13:33,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:13:33,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:13:33,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:13:33,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:13:33" (1/1) ... [2022-07-21 02:13:33,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b70be88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:33, skipping insertion in model container [2022-07-21 02:13:33,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:13:33" (1/1) ... [2022-07-21 02:13:33,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:13:33,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:13:34,143 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-simple/dll2c_insert_equal.i[24877,24890] [2022-07-21 02:13:34,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:13:34,162 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:13:34,199 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-simple/dll2c_insert_equal.i[24877,24890] [2022-07-21 02:13:34,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:13:34,223 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:13:34,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34 WrapperNode [2022-07-21 02:13:34,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:13:34,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:13:34,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:13:34,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:13:34,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (1/1) ... [2022-07-21 02:13:34,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (1/1) ... [2022-07-21 02:13:34,280 INFO L137 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 154 [2022-07-21 02:13:34,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:13:34,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:13:34,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:13:34,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:13:34,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (1/1) ... [2022-07-21 02:13:34,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (1/1) ... [2022-07-21 02:13:34,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (1/1) ... [2022-07-21 02:13:34,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (1/1) ... [2022-07-21 02:13:34,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (1/1) ... [2022-07-21 02:13:34,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (1/1) ... [2022-07-21 02:13:34,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (1/1) ... [2022-07-21 02:13:34,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:13:34,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:13:34,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:13:34,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:13:34,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (1/1) ... [2022-07-21 02:13:34,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:13:34,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:13:34,393 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-21 02:13:34,397 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-21 02:13:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:13:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:13:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 02:13:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 02:13:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:13:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:13:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 02:13:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:13:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:13:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:13:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 02:13:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:13:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:13:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:13:34,610 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:13:34,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:13:34,936 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:13:34,944 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:13:34,944 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 02:13:34,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:13:34 BoogieIcfgContainer [2022-07-21 02:13:34,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:13:34,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:13:34,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:13:34,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:13:34,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:13:33" (1/3) ... [2022-07-21 02:13:34,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98eac6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:13:34, skipping insertion in model container [2022-07-21 02:13:34,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:34" (2/3) ... [2022-07-21 02:13:34,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98eac6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:13:34, skipping insertion in model container [2022-07-21 02:13:34,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:13:34" (3/3) ... [2022-07-21 02:13:34,954 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-07-21 02:13:34,968 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:13:34,968 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:13:35,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:13:35,042 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@64edae15, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1eba6f4 [2022-07-21 02:13:35,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:13:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:13:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:13:35,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:13:35,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:13:35,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:13:35,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:13:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1237252285, now seen corresponding path program 1 times [2022-07-21 02:13:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:13:35,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383854823] [2022-07-21 02:13:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:13:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:13:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:35,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:13:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:35,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:13:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:13:35,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:13:35,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383854823] [2022-07-21 02:13:35,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383854823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:13:35,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:13:35,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:13:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100579633] [2022-07-21 02:13:35,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:13:35,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:13:35,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:13:35,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:13:35,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:13:35,401 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:13:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:13:35,500 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2022-07-21 02:13:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:13:35,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-21 02:13:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:13:35,509 INFO L225 Difference]: With dead ends: 67 [2022-07-21 02:13:35,509 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:13:35,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 02:13:35,518 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:13:35,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:13:35,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:13:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 02:13:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:13:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-21 02:13:35,558 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 25 [2022-07-21 02:13:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:13:35,559 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-21 02:13:35,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:13:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-07-21 02:13:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:13:35,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:13:35,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:13:35,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:13:35,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:13:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:13:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1104710801, now seen corresponding path program 1 times [2022-07-21 02:13:35,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:13:35,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186186351] [2022-07-21 02:13:35,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:13:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:13:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:35,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:13:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:35,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:13:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:13:35,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:13:35,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186186351] [2022-07-21 02:13:35,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186186351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:13:35,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:13:35,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:13:35,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026173433] [2022-07-21 02:13:35,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:13:35,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:13:35,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:13:35,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:13:35,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:13:35,718 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:13:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:13:35,783 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-07-21 02:13:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:13:35,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-21 02:13:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:13:35,785 INFO L225 Difference]: With dead ends: 56 [2022-07-21 02:13:35,785 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:13:35,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:13:35,787 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:13:35,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 82 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:13:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:13:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-21 02:13:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:13:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-21 02:13:35,809 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2022-07-21 02:13:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:13:35,811 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-21 02:13:35,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:13:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-21 02:13:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 02:13:35,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:13:35,815 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:13:35,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:13:35,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:13:35,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:13:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash -313226979, now seen corresponding path program 1 times [2022-07-21 02:13:35,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:13:35,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117430239] [2022-07-21 02:13:35,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:13:35,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:13:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:13:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:13:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 02:13:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:13:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:13:35,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117430239] [2022-07-21 02:13:35,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117430239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:13:35,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:13:35,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:13:35,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231364626] [2022-07-21 02:13:35,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:13:35,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:13:35,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:13:35,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:13:35,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:13:35,993 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 02:13:36,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:13:36,054 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-07-21 02:13:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:13:36,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-07-21 02:13:36,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:13:36,056 INFO L225 Difference]: With dead ends: 49 [2022-07-21 02:13:36,056 INFO L226 Difference]: Without dead ends: 41 [2022-07-21 02:13:36,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:13:36,058 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 13 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:13:36,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 95 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:13:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-21 02:13:36,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-07-21 02:13:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:13:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-07-21 02:13:36,065 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 35 [2022-07-21 02:13:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:13:36,065 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-07-21 02:13:36,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 02:13:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-07-21 02:13:36,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 02:13:36,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:13:36,067 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:13:36,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:13:36,067 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:13:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:13:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash 415590512, now seen corresponding path program 1 times [2022-07-21 02:13:36,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:13:36,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19186621] [2022-07-21 02:13:36,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:13:36,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:13:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:37,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:13:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:13:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:37,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 02:13:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:13:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:13:37,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19186621] [2022-07-21 02:13:37,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19186621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:13:37,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521137004] [2022-07-21 02:13:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:13:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:13:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:13:37,739 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-21 02:13:37,771 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-21 02:13:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:38,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 203 conjunts are in the unsatisfiable core [2022-07-21 02:13:38,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:13:38,551 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-21 02:13:38,641 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-21 02:13:38,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:38,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:38,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:38,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-21 02:13:38,861 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:13:38,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-21 02:13:39,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:13:39,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:39,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:39,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:39,260 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-21 02:13:39,272 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:13:39,440 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:13:39,440 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 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-21 02:13:39,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:39,501 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:13:39,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-07-21 02:13:39,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-21 02:13:39,692 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 19 treesize of output 18 [2022-07-21 02:13:39,731 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 26 treesize of output 28 [2022-07-21 02:13:39,892 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:13:39,893 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 102 treesize of output 87 [2022-07-21 02:13:39,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:13:39,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-21 02:13:40,248 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:13:40,248 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 95 [2022-07-21 02:13:40,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-21 02:13:40,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2022-07-21 02:13:40,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-07-21 02:13:40,286 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 14 treesize of output 18 [2022-07-21 02:13:40,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2022-07-21 02:13:40,301 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 14 treesize of output 18 [2022-07-21 02:13:40,585 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:13:40,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 63 [2022-07-21 02:13:40,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-21 02:13:40,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 02:13:40,625 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 7 treesize of output 3 [2022-07-21 02:13:40,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,903 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:13:40,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 115 [2022-07-21 02:13:40,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,917 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 18 treesize of output 20 [2022-07-21 02:13:40,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2022-07-21 02:13:40,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:40,960 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:13:40,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-21 02:13:41,536 INFO L356 Elim1Store]: treesize reduction 72, result has 20.0 percent of original size [2022-07-21 02:13:41,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 292 treesize of output 161 [2022-07-21 02:13:41,587 INFO L356 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2022-07-21 02:13:41,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 258 treesize of output 199 [2022-07-21 02:13:41,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:41,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:41,640 INFO L356 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2022-07-21 02:13:41,642 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 02:13:41,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 02:13:41,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:13:41,848 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.offset_49| input size 87 context size 87 output size 87 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 02:13:41,851 INFO L158 Benchmark]: Toolchain (without parser) took 8048.06ms. Allocated memory was 60.8MB in the beginning and 123.7MB in the end (delta: 62.9MB). Free memory was 39.9MB in the beginning and 42.8MB in the end (delta: -3.0MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2022-07-21 02:13:41,851 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:13:41,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.16ms. Allocated memory is still 60.8MB. Free memory was 39.7MB in the beginning and 36.2MB in the end (delta: 3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 02:13:41,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.85ms. Allocated memory is still 60.8MB. Free memory was 36.2MB in the beginning and 33.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:13:41,852 INFO L158 Benchmark]: Boogie Preprocessor took 67.03ms. Allocated memory is still 60.8MB. Free memory was 33.9MB in the beginning and 32.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:13:41,852 INFO L158 Benchmark]: RCFGBuilder took 596.18ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 32.0MB in the beginning and 46.2MB in the end (delta: -14.2MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-07-21 02:13:41,852 INFO L158 Benchmark]: TraceAbstraction took 6902.07ms. Allocated memory was 77.6MB in the beginning and 123.7MB in the end (delta: 46.1MB). Free memory was 45.9MB in the beginning and 42.8MB in the end (delta: 3.1MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2022-07-21 02:13:41,854 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.26ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.16ms. Allocated memory is still 60.8MB. Free memory was 39.7MB in the beginning and 36.2MB in the end (delta: 3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.85ms. Allocated memory is still 60.8MB. Free memory was 36.2MB in the beginning and 33.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.03ms. Allocated memory is still 60.8MB. Free memory was 33.9MB in the beginning and 32.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 596.18ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 32.0MB in the beginning and 46.2MB in the end (delta: -14.2MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6902.07ms. Allocated memory was 77.6MB in the beginning and 123.7MB in the end (delta: 46.1MB). Free memory was 45.9MB in the beginning and 42.8MB in the end (delta: 3.1MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.offset_49| input size 87 context size 87 output size 87 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.offset_49| input size 87 context size 87 output size 87: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 02:13:41,887 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:13:43,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:13:43,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:13:43,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:13:43,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:13:43,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:13:43,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:13:43,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:13:43,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:13:43,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:13:43,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:13:43,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:13:43,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:13:43,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:13:43,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:13:43,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:13:43,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:13:43,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:13:43,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:13:43,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:13:43,898 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:13:43,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:13:43,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:13:43,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:13:43,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:13:43,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:13:43,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:13:43,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:13:43,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:13:43,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:13:43,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:13:43,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:13:43,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:13:43,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:13:43,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:13:43,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:13:43,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:13:43,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:13:43,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:13:43,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:13:43,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:13:43,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:13:43,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 02:13:43,964 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:13:43,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:13:43,965 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:13:43,965 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:13:43,966 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:13:43,966 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:13:43,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:13:43,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:13:43,967 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:13:43,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:13:43,969 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:13:43,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:13:43,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:13:43,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:13:43,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:13:43,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:13:43,970 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 02:13:43,970 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 02:13:43,970 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 02:13:43,971 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:13:43,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:13:43,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:13:43,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:13:43,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:13:43,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:13:43,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:13:43,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:13:43,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:13:43,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:13:43,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:13:43,973 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 02:13:43,973 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 02:13:43,973 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:13:43,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:13:43,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:13:43,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 02:13:43,974 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 ! call(reach_error())) ) 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2022-07-21 02:13:44,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:13:44,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:13:44,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:13:44,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:13:44,312 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:13:44,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-07-21 02:13:44,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7342c3b61/d1f1eab1c76e4a76b17116081e2cf207/FLAG2b62100e7 [2022-07-21 02:13:44,800 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:13:44,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-07-21 02:13:44,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7342c3b61/d1f1eab1c76e4a76b17116081e2cf207/FLAG2b62100e7 [2022-07-21 02:13:44,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7342c3b61/d1f1eab1c76e4a76b17116081e2cf207 [2022-07-21 02:13:44,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:13:44,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:13:44,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:13:44,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:13:44,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:13:44,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:13:44" (1/1) ... [2022-07-21 02:13:44,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec0c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:44, skipping insertion in model container [2022-07-21 02:13:44,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:13:44" (1/1) ... [2022-07-21 02:13:44,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:13:44,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:13:45,234 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-simple/dll2c_insert_equal.i[24877,24890] [2022-07-21 02:13:45,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:13:45,253 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:13:45,313 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-simple/dll2c_insert_equal.i[24877,24890] [2022-07-21 02:13:45,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:13:45,349 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:13:45,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45 WrapperNode [2022-07-21 02:13:45,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:13:45,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:13:45,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:13:45,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:13:45,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (1/1) ... [2022-07-21 02:13:45,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (1/1) ... [2022-07-21 02:13:45,426 INFO L137 Inliner]: procedures = 130, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 155 [2022-07-21 02:13:45,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:13:45,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:13:45,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:13:45,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:13:45,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (1/1) ... [2022-07-21 02:13:45,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (1/1) ... [2022-07-21 02:13:45,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (1/1) ... [2022-07-21 02:13:45,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (1/1) ... [2022-07-21 02:13:45,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (1/1) ... [2022-07-21 02:13:45,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (1/1) ... [2022-07-21 02:13:45,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (1/1) ... [2022-07-21 02:13:45,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:13:45,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:13:45,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:13:45,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:13:45,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (1/1) ... [2022-07-21 02:13:45,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:13:45,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:13:45,534 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-21 02:13:45,539 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-21 02:13:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 02:13:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 02:13:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 02:13:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:13:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:13:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 02:13:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 02:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 02:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 02:13:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:13:45,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:13:45,721 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:13:45,722 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:13:46,317 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:13:46,323 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:13:46,323 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 02:13:46,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:13:46 BoogieIcfgContainer [2022-07-21 02:13:46,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:13:46,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:13:46,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:13:46,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:13:46,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:13:44" (1/3) ... [2022-07-21 02:13:46,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f44ebaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:13:46, skipping insertion in model container [2022-07-21 02:13:46,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:13:45" (2/3) ... [2022-07-21 02:13:46,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f44ebaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:13:46, skipping insertion in model container [2022-07-21 02:13:46,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:13:46" (3/3) ... [2022-07-21 02:13:46,332 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-07-21 02:13:46,345 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:13:46,345 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:13:46,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:13:46,387 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@fd48f5c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e21b577 [2022-07-21 02:13:46,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:13:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:13:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:13:46,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:13:46,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:13:46,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:13:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:13:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1237252285, now seen corresponding path program 1 times [2022-07-21 02:13:46,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:13:46,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495556592] [2022-07-21 02:13:46,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:13:46,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:13:46,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:13:46,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:13:46,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 02:13:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:46,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 02:13:46,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:13:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:13:46,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:13:46,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:13:46,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495556592] [2022-07-21 02:13:46,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495556592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:13:46,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:13:46,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 02:13:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357659436] [2022-07-21 02:13:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:13:46,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 02:13:46,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:13:46,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 02:13:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:13:46,745 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 02:13:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:13:46,766 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2022-07-21 02:13:46,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 02:13:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-21 02:13:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:13:46,773 INFO L225 Difference]: With dead ends: 67 [2022-07-21 02:13:46,774 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:13:46,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:13:46,780 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:13:46,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:13:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:13:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 02:13:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:13:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-21 02:13:46,812 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 25 [2022-07-21 02:13:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:13:46,814 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-21 02:13:46,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 02:13:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-07-21 02:13:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:13:46,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:13:46,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:13:46,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 02:13:47,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:13:47,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:13:47,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:13:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1104710801, now seen corresponding path program 1 times [2022-07-21 02:13:47,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:13:47,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10555468] [2022-07-21 02:13:47,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:13:47,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:13:47,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:13:47,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:13:47,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 02:13:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:47,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 02:13:47,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:13:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:13:47,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:13:47,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:13:47,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10555468] [2022-07-21 02:13:47,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10555468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:13:47,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:13:47,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:13:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085844039] [2022-07-21 02:13:47,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:13:47,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:13:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:13:47,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:13:47,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:13:47,276 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:13:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:13:47,298 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-07-21 02:13:47,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:13:47,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-21 02:13:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:13:47,306 INFO L225 Difference]: With dead ends: 56 [2022-07-21 02:13:47,307 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:13:47,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-21 02:13:47,309 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:13:47,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 69 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:13:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:13:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-21 02:13:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:13:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-21 02:13:47,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2022-07-21 02:13:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:13:47,320 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-21 02:13:47,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:13:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-21 02:13:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 02:13:47,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:13:47,323 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:13:47,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 02:13:47,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:13:47,528 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:13:47,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:13:47,528 INFO L85 PathProgramCache]: Analyzing trace with hash -313226979, now seen corresponding path program 1 times [2022-07-21 02:13:47,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:13:47,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032888019] [2022-07-21 02:13:47,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:13:47,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:13:47,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:13:47,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:13:47,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 02:13:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:47,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 02:13:47,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:13:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:13:47,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:13:47,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:13:47,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032888019] [2022-07-21 02:13:47,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032888019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:13:47,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:13:47,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:13:47,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481669014] [2022-07-21 02:13:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:13:47,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:13:47,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:13:47,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:13:47,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:13:47,752 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 02:13:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:13:47,797 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-07-21 02:13:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:13:47,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-21 02:13:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:13:47,801 INFO L225 Difference]: With dead ends: 43 [2022-07-21 02:13:47,801 INFO L226 Difference]: Without dead ends: 32 [2022-07-21 02:13:47,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:13:47,804 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:13:47,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:13:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-21 02:13:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-21 02:13:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:13:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-07-21 02:13:47,814 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 35 [2022-07-21 02:13:47,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:13:47,819 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-07-21 02:13:47,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 02:13:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-07-21 02:13:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 02:13:47,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:13:47,822 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:13:47,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 02:13:48,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:13:48,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:13:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:13:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash 415590512, now seen corresponding path program 1 times [2022-07-21 02:13:48,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:13:48,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5629127] [2022-07-21 02:13:48,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:13:48,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:13:48,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:13:48,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:13:48,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 02:13:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:48,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-21 02:13:48,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:13:48,499 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-21 02:13:48,563 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-21 02:13:48,748 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:13:48,748 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 24 [2022-07-21 02:13:48,942 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:13:49,044 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:13:49,177 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-21 02:13:49,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-21 02:13:49,329 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:13:49,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 02:13:49,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:13:49,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:13:49,882 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-21 02:13:49,882 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 66 [2022-07-21 02:13:49,897 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 02:13:49,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:49,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-21 02:13:49,923 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 14 treesize of output 18 [2022-07-21 02:13:50,305 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-07-21 02:13:50,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 44 [2022-07-21 02:13:50,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-21 02:13:50,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-07-21 02:13:50,339 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 7 treesize of output 3 [2022-07-21 02:13:50,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:50,715 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:13:50,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 80 [2022-07-21 02:13:50,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:50,734 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 18 treesize of output 20 [2022-07-21 02:13:50,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:50,778 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-21 02:13:50,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2022-07-21 02:13:50,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:13:51,915 INFO L356 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2022-07-21 02:13:51,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 236 treesize of output 145 [2022-07-21 02:13:52,081 INFO L356 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2022-07-21 02:13:52,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 254 treesize of output 197 [2022-07-21 02:13:52,116 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-07-21 02:13:52,225 INFO L356 Elim1Store]: treesize reduction 213, result has 11.6 percent of original size [2022-07-21 02:13:52,226 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 133 [2022-07-21 02:13:52,270 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-21 02:13:52,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 141 [2022-07-21 02:13:52,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-07-21 02:13:52,305 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 9 treesize of output 7 [2022-07-21 02:13:52,521 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:13:52,521 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 46 [2022-07-21 02:13:52,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:13:52,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 18 [2022-07-21 02:13:52,703 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-21 02:13:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:13:52,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:13:53,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_464 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_448) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_464) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:13:53,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (_ BitVec 32))) (= (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_465) .cse0 v_ArrVal_448) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_453) .cse0 v_ArrVal_464) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7|))) .cse0 v_ArrVal_467) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:13:53,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (_ BitVec 32))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select .cse3 .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_447)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_465) .cse2 v_ArrVal_448) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse3 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_453) .cse2 v_ArrVal_464) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7|))) .cse2 v_ArrVal_467) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:13:55,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:13:55,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5629127] [2022-07-21 02:13:55,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5629127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:13:55,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [214714200] [2022-07-21 02:13:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:13:55,242 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:13:55,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:13:55,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 02:13:55,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-07-21 02:13:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:13:56,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-21 02:13:56,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:13:56,282 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-21 02:13:57,022 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:13:57,275 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:13:57,275 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 20 treesize of output 27 [2022-07-21 02:13:57,498 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-21 02:13:57,513 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-21 02:13:57,535 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 19 treesize of output 18 [2022-07-21 02:13:57,768 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 14 treesize of output 16 [2022-07-21 02:13:57,804 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 14 treesize of output 16 [2022-07-21 02:13:57,817 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 14 treesize of output 16 [2022-07-21 02:13:58,404 INFO L356 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-07-21 02:13:58,405 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 02:13:58,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 02:13:58,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2022-07-21 02:13:58,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 02:13:58,807 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_57| input size 69 context size 69 output size 69 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 02:13:58,810 INFO L158 Benchmark]: Toolchain (without parser) took 13975.15ms. Allocated memory was 56.6MB in the beginning and 92.3MB in the end (delta: 35.7MB). Free memory was 39.9MB in the beginning and 31.0MB in the end (delta: 8.9MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2022-07-21 02:13:58,810 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 46.1MB. Free memory was 28.3MB in the beginning and 28.2MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:13:58,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.81ms. Allocated memory is still 56.6MB. Free memory was 39.7MB in the beginning and 31.3MB in the end (delta: 8.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 02:13:58,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.23ms. Allocated memory is still 56.6MB. Free memory was 31.1MB in the beginning and 28.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:13:58,811 INFO L158 Benchmark]: Boogie Preprocessor took 73.70ms. Allocated memory is still 56.6MB. Free memory was 28.6MB in the beginning and 39.6MB in the end (delta: -11.0MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-07-21 02:13:58,811 INFO L158 Benchmark]: RCFGBuilder took 822.95ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 32.6MB in the end (delta: 7.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-07-21 02:13:58,812 INFO L158 Benchmark]: TraceAbstraction took 12482.88ms. Allocated memory was 56.6MB in the beginning and 92.3MB in the end (delta: 35.7MB). Free memory was 32.1MB in the beginning and 31.0MB in the end (delta: 1.1MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-07-21 02:13:58,813 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.11ms. Allocated memory is still 46.1MB. Free memory was 28.3MB in the beginning and 28.2MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.81ms. Allocated memory is still 56.6MB. Free memory was 39.7MB in the beginning and 31.3MB in the end (delta: 8.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.23ms. Allocated memory is still 56.6MB. Free memory was 31.1MB in the beginning and 28.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.70ms. Allocated memory is still 56.6MB. Free memory was 28.6MB in the beginning and 39.6MB in the end (delta: -11.0MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * RCFGBuilder took 822.95ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 32.6MB in the end (delta: 7.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12482.88ms. Allocated memory was 56.6MB in the beginning and 92.3MB in the end (delta: 35.7MB). Free memory was 32.1MB in the beginning and 31.0MB in the end (delta: 1.1MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_57| input size 69 context size 69 output size 69 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_57| input size 69 context size 69 output size 69: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 02:13:58,842 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 Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_57| input size 69 context size 69 output size 69