./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/dll2n_update_all.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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:42:15,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:42:15,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:42:15,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:42:15,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:42:15,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:42:15,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:42:15,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:42:15,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:42:15,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:42:15,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:42:15,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:42:15,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:42:15,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:42:15,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:42:15,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:42:15,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:42:15,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:42:15,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:42:15,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:42:15,321 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:42:15,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:42:15,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:42:15,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:42:15,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:42:15,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:42:15,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:42:15,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:42:15,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:42:15,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:42:15,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:42:15,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:42:15,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:42:15,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:42:15,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:42:15,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:42:15,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:42:15,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:42:15,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:42:15,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:42:15,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:42:15,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:42:15,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:42:15,360 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:42:15,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:42:15,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:42:15,361 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:42:15,361 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:42:15,362 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:42:15,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:42:15,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:42:15,362 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:42:15,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:42:15,363 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:42:15,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:42:15,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:42:15,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:42:15,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:42:15,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:42:15,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:42:15,364 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:42:15,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:42:15,365 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:42:15,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:42:15,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:42:15,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:42:15,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:42:15,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:42:15,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:42:15,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:42:15,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:42:15,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:42:15,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:42:15,367 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:42:15,367 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:42:15,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:42:15,367 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2022-07-19 14:42:15,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:42:15,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:42:15,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:42:15,596 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:42:15,597 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:42:15,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-07-19 14:42:15,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660da8ff6/632b248574fd4fc5b783d20f3a4c6a93/FLAGec9e4b766 [2022-07-19 14:42:16,052 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:42:16,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-07-19 14:42:16,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660da8ff6/632b248574fd4fc5b783d20f3a4c6a93/FLAGec9e4b766 [2022-07-19 14:42:16,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660da8ff6/632b248574fd4fc5b783d20f3a4c6a93 [2022-07-19 14:42:16,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:42:16,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:42:16,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:42:16,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:42:16,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:42:16,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0847bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16, skipping insertion in model container [2022-07-19 14:42:16,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:42:16,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:42:16,367 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/dll2n_update_all.i[24455,24468] [2022-07-19 14:42:16,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:42:16,382 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:42:16,445 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/dll2n_update_all.i[24455,24468] [2022-07-19 14:42:16,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:42:16,477 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:42:16,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16 WrapperNode [2022-07-19 14:42:16,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:42:16,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:42:16,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:42:16,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:42:16,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,514 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2022-07-19 14:42:16,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:42:16,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:42:16,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:42:16,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:42:16,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:42:16,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:42:16,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:42:16,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:42:16,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (1/1) ... [2022-07-19 14:42:16,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:42:16,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:16,581 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-19 14:42:16,583 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-19 14:42:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-19 14:42:16,610 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-19 14:42:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:42:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:42:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:42:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:42:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:42:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:42:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:42:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:42:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:42:16,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:42:16,712 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:42:16,714 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:42:16,774 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-19 14:42:16,950 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:42:16,956 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:42:16,956 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-19 14:42:16,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:42:16 BoogieIcfgContainer [2022-07-19 14:42:16,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:42:16,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:42:16,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:42:16,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:42:16,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:42:16" (1/3) ... [2022-07-19 14:42:16,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8752e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:42:16, skipping insertion in model container [2022-07-19 14:42:16,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:16" (2/3) ... [2022-07-19 14:42:16,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8752e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:42:16, skipping insertion in model container [2022-07-19 14:42:16,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:42:16" (3/3) ... [2022-07-19 14:42:16,966 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2022-07-19 14:42:16,978 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:42:16,978 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:42:17,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:42:17,034 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@24cdbb38, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3161457a [2022-07-19 14:42:17,034 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:42:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 30 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 14:42:17,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:17,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:17,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:17,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:17,056 INFO L85 PathProgramCache]: Analyzing trace with hash -465735870, now seen corresponding path program 1 times [2022-07-19 14:42:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:17,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198104683] [2022-07-19 14:42:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:17,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:17,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198104683] [2022-07-19 14:42:17,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198104683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:17,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:42:17,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:42:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617980331] [2022-07-19 14:42:17,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:17,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:42:17,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:42:17,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:42:17,202 INFO L87 Difference]: Start difference. First operand has 32 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 30 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:17,215 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2022-07-19 14:42:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:42:17,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-19 14:42:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:17,222 INFO L225 Difference]: With dead ends: 54 [2022-07-19 14:42:17,222 INFO L226 Difference]: Without dead ends: 23 [2022-07-19 14:42:17,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-19 14:42:17,227 INFO L413 NwaCegarLoop]: 39 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, 39 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-19 14:42:17,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-19 14:42:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-19 14:42:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-07-19 14:42:17,254 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 13 [2022-07-19 14:42:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:17,255 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-07-19 14:42:17,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-07-19 14:42:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 14:42:17,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:17,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:17,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:42:17,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:17,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:17,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1372290212, now seen corresponding path program 1 times [2022-07-19 14:42:17,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:17,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222870655] [2022-07-19 14:42:17,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:17,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:17,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:17,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222870655] [2022-07-19 14:42:17,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222870655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:17,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:42:17,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:42:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839195523] [2022-07-19 14:42:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:17,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:42:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:42:17,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:42:17,320 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:17,332 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-07-19 14:42:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:42:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-19 14:42:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:17,333 INFO L225 Difference]: With dead ends: 44 [2022-07-19 14:42:17,333 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:42:17,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:42:17,335 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 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-19 14:42:17,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:17,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:42:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-19 14:42:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-07-19 14:42:17,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2022-07-19 14:42:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:17,341 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-07-19 14:42:17,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-07-19 14:42:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:42:17,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:17,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:17,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:42:17,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:17,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:17,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2143586260, now seen corresponding path program 1 times [2022-07-19 14:42:17,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:17,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888082985] [2022-07-19 14:42:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:17,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:17,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888082985] [2022-07-19 14:42:17,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888082985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:17,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:42:17,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:42:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388675782] [2022-07-19 14:42:17,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:17,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:42:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:17,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:42:17,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:42:17,436 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:17,457 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-07-19 14:42:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:42:17,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-19 14:42:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:17,462 INFO L225 Difference]: With dead ends: 49 [2022-07-19 14:42:17,462 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:42:17,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:42:17,468 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:17,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:42:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-19 14:42:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-07-19 14:42:17,479 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2022-07-19 14:42:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:17,480 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-07-19 14:42:17,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-07-19 14:42:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:42:17,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:17,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:17,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:42:17,481 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1556780246, now seen corresponding path program 1 times [2022-07-19 14:42:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:17,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573789126] [2022-07-19 14:42:17,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:17,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:17,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573789126] [2022-07-19 14:42:17,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573789126] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:17,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786884274] [2022-07-19 14:42:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:17,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:17,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:17,583 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-19 14:42:17,591 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-19 14:42:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:17,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:42:17,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:17,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:17,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786884274] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:42:17,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:42:17,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-19 14:42:17,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888835552] [2022-07-19 14:42:17,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:17,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:42:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:17,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:42:17,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:42:17,732 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:17,748 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-07-19 14:42:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:42:17,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-19 14:42:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:17,749 INFO L225 Difference]: With dead ends: 45 [2022-07-19 14:42:17,749 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 14:42:17,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:42:17,751 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:17,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 14:42:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-19 14:42:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-19 14:42:17,755 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2022-07-19 14:42:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:17,756 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-19 14:42:17,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-07-19 14:42:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 14:42:17,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:17,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:17,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:17,977 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-19 14:42:17,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:17,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash -976830750, now seen corresponding path program 1 times [2022-07-19 14:42:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:17,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965734399] [2022-07-19 14:42:17,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:17,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:42:18,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:18,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965734399] [2022-07-19 14:42:18,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965734399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:18,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511552458] [2022-07-19 14:42:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:18,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:18,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:18,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:18,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:42:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:18,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:42:18,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:42:18,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:42:18,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511552458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:18,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:42:18,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-19 14:42:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494474603] [2022-07-19 14:42:18,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:18,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:42:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:18,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:42:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:42:18,243 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:18,272 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-07-19 14:42:18,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:42:18,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-19 14:42:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:18,275 INFO L225 Difference]: With dead ends: 51 [2022-07-19 14:42:18,279 INFO L226 Difference]: Without dead ends: 42 [2022-07-19 14:42:18,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:42:18,280 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:18,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 43 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-19 14:42:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-07-19 14:42:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-19 14:42:18,289 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 23 [2022-07-19 14:42:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:18,289 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-19 14:42:18,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-19 14:42:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:42:18,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:18,291 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, 1, 1, 1] [2022-07-19 14:42:18,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:18,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:18,515 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:18,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:18,516 INFO L85 PathProgramCache]: Analyzing trace with hash -209353439, now seen corresponding path program 1 times [2022-07-19 14:42:18,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:18,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731965504] [2022-07-19 14:42:18,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:18,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:42:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:18,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731965504] [2022-07-19 14:42:18,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731965504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:18,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161858963] [2022-07-19 14:42:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:18,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:18,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:18,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:18,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:42:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:18,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:42:18,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:42:18,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:42:18,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161858963] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:42:18,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:42:18,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-19 14:42:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261468317] [2022-07-19 14:42:18,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:18,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 14:42:18,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:18,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 14:42:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:42:18,867 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:18,937 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-07-19 14:42:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:42:18,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-19 14:42:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:18,939 INFO L225 Difference]: With dead ends: 64 [2022-07-19 14:42:18,939 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 14:42:18,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:42:18,942 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 78 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:18,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 101 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 14:42:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2022-07-19 14:42:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-19 14:42:18,957 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 28 [2022-07-19 14:42:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:18,957 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-19 14:42:18,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-07-19 14:42:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 14:42:18,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:18,959 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:18,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:19,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:19,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash -141308350, now seen corresponding path program 2 times [2022-07-19 14:42:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:19,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733321765] [2022-07-19 14:42:19,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:19,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:42:19,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:19,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733321765] [2022-07-19 14:42:19,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733321765] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:19,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591488777] [2022-07-19 14:42:19,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:42:19,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:19,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:19,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:19,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 14:42:19,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:42:19,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:42:19,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:42:19,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:42:19,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:42:19,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591488777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:42:19,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:42:19,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-19 14:42:19,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053798865] [2022-07-19 14:42:19,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:19,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:42:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:19,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:42:19,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:42:19,511 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:19,641 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-07-19 14:42:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:42:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-19 14:42:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:19,648 INFO L225 Difference]: With dead ends: 59 [2022-07-19 14:42:19,649 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 14:42:19,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-19 14:42:19,651 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:19,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 147 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:42:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 14:42:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-07-19 14:42:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-19 14:42:19,666 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 33 [2022-07-19 14:42:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:19,667 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-19 14:42:19,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-19 14:42:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 14:42:19,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:19,670 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:19,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:19,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:19,875 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1882863022, now seen corresponding path program 1 times [2022-07-19 14:42:19,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:19,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831029344] [2022-07-19 14:42:19,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:19,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:20,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831029344] [2022-07-19 14:42:20,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831029344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:20,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276210939] [2022-07-19 14:42:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:20,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:20,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:20,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:20,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 14:42:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:20,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-19 14:42:20,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:20,497 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-19 14:42:20,564 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:42:20,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 14:42:20,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:20,609 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 18 treesize of output 19 [2022-07-19 14:42:20,666 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:42:20,667 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 32 treesize of output 33 [2022-07-19 14:42:20,913 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-19 14:42:20,919 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 27 treesize of output 29 [2022-07-19 14:42:21,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:42:21,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2022-07-19 14:42:21,101 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 14 treesize of output 16 [2022-07-19 14:42:21,245 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 22 treesize of output 10 [2022-07-19 14:42:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:21,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:21,405 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_448 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_448 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-07-19 14:42:21,421 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_448 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_448) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_448 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_448) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-19 14:42:21,432 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_448 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_448) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_448 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_448) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-19 14:42:21,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:42:21,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-19 14:42:21,467 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:42:21,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 61 [2022-07-19 14:42:21,472 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 23 treesize of output 21 [2022-07-19 14:42:21,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:42:21,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-19 14:42:21,518 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-07-19 14:42:21,533 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 23 treesize of output 21 [2022-07-19 14:42:21,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_443) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2022-07-19 14:42:21,820 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:42:21,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-19 14:42:21,825 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:42:21,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2022-07-19 14:42:21,828 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 8 treesize of output 4 [2022-07-19 14:42:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-19 14:42:21,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276210939] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:42:21,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:42:21,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 51 [2022-07-19 14:42:21,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76339118] [2022-07-19 14:42:21,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:21,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 14:42:21,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 14:42:21,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1996, Unknown=4, NotChecked=372, Total=2550 [2022-07-19 14:42:21,932 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 51 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 51 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:24,295 INFO L93 Difference]: Finished difference Result 205 states and 246 transitions. [2022-07-19 14:42:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-19 14:42:24,296 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 51 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 14:42:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:24,298 INFO L225 Difference]: With dead ends: 205 [2022-07-19 14:42:24,298 INFO L226 Difference]: Without dead ends: 203 [2022-07-19 14:42:24,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=642, Invalid=5848, Unknown=6, NotChecked=644, Total=7140 [2022-07-19 14:42:24,302 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 339 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:24,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 647 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 925 Invalid, 0 Unknown, 384 Unchecked, 0.6s Time] [2022-07-19 14:42:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-19 14:42:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 63. [2022-07-19 14:42:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 62 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-07-19 14:42:24,315 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 34 [2022-07-19 14:42:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:24,315 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-07-19 14:42:24,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 51 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-07-19 14:42:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 14:42:24,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:24,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:24,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:24,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:24,543 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:24,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2016876528, now seen corresponding path program 1 times [2022-07-19 14:42:24,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:24,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923647449] [2022-07-19 14:42:24,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:24,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:42:24,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:24,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923647449] [2022-07-19 14:42:24,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923647449] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:24,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448996747] [2022-07-19 14:42:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:24,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:24,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:24,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:24,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 14:42:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:24,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:42:24,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:42:24,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:42:24,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448996747] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:42:24,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:42:24,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-19 14:42:24,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482415810] [2022-07-19 14:42:24,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:24,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:42:24,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:24,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:42:24,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:42:24,715 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:24,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:24,740 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2022-07-19 14:42:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:42:24,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 14:42:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:24,742 INFO L225 Difference]: With dead ends: 116 [2022-07-19 14:42:24,742 INFO L226 Difference]: Without dead ends: 61 [2022-07-19 14:42:24,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-19 14:42:24,744 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:24,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-19 14:42:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-19 14:42:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-07-19 14:42:24,757 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 34 [2022-07-19 14:42:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:24,757 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-07-19 14:42:24,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-07-19 14:42:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:42:24,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:24,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:24,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:24,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:24,972 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:24,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1812442575, now seen corresponding path program 1 times [2022-07-19 14:42:24,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:24,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907481268] [2022-07-19 14:42:24,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:24,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:42:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:25,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907481268] [2022-07-19 14:42:25,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907481268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:25,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:42:25,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:42:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649940449] [2022-07-19 14:42:25,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:25,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:42:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:42:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:42:25,043 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:25,067 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-07-19 14:42:25,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:42:25,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-19 14:42:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:25,068 INFO L225 Difference]: With dead ends: 78 [2022-07-19 14:42:25,069 INFO L226 Difference]: Without dead ends: 70 [2022-07-19 14:42:25,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 14:42:25,069 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:25,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 67 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-19 14:42:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-07-19 14:42:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-07-19 14:42:25,089 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 35 [2022-07-19 14:42:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:25,089 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-07-19 14:42:25,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-07-19 14:42:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:42:25,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:25,095 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:25,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 14:42:25,095 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:25,096 INFO L85 PathProgramCache]: Analyzing trace with hash -36483006, now seen corresponding path program 2 times [2022-07-19 14:42:25,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:25,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611889195] [2022-07-19 14:42:25,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:25,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:42:25,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:25,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611889195] [2022-07-19 14:42:25,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611889195] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:25,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907470405] [2022-07-19 14:42:25,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:42:25,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:25,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:25,172 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:25,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 14:42:25,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:42:25,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:42:25,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:42:25,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:42:25,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:42:25,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907470405] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:42:25,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:42:25,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-19 14:42:25,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334779936] [2022-07-19 14:42:25,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:25,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:42:25,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:25,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:42:25,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:42:25,353 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:25,401 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2022-07-19 14:42:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:42:25,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-19 14:42:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:25,402 INFO L225 Difference]: With dead ends: 104 [2022-07-19 14:42:25,402 INFO L226 Difference]: Without dead ends: 82 [2022-07-19 14:42:25,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:42:25,403 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 99 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:25,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 71 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-19 14:42:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2022-07-19 14:42:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-19 14:42:25,413 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 35 [2022-07-19 14:42:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:25,413 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-19 14:42:25,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-19 14:42:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 14:42:25,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:25,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:25,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:25,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:25,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:25,628 INFO L85 PathProgramCache]: Analyzing trace with hash 656694366, now seen corresponding path program 3 times [2022-07-19 14:42:25,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:25,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621032917] [2022-07-19 14:42:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:42:25,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:25,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621032917] [2022-07-19 14:42:25,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621032917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:25,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874008764] [2022-07-19 14:42:25,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 14:42:25,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:25,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:25,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:25,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 14:42:25,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 14:42:25,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:42:25,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:42:25,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:42:25,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:42:25,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874008764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:25,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:42:25,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-19 14:42:25,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564725036] [2022-07-19 14:42:25,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:25,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:42:25,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:25,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:42:25,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:42:25,957 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:25,971 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-07-19 14:42:25,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:42:25,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-19 14:42:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:25,972 INFO L225 Difference]: With dead ends: 82 [2022-07-19 14:42:25,972 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 14:42:25,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:42:25,973 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:25,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 37 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 14:42:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-19 14:42:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-07-19 14:42:25,982 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 39 [2022-07-19 14:42:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:25,982 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-07-19 14:42:25,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-07-19 14:42:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 14:42:25,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:25,983 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:26,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:26,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 14:42:26,208 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash -367645571, now seen corresponding path program 1 times [2022-07-19 14:42:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:26,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801658774] [2022-07-19 14:42:26,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:26,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:42:26,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:26,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801658774] [2022-07-19 14:42:26,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801658774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:26,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009187760] [2022-07-19 14:42:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:26,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:26,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:26,251 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:26,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 14:42:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:26,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:42:26,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:42:26,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:42:26,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009187760] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:42:26,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:42:26,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-19 14:42:26,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601057770] [2022-07-19 14:42:26,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:26,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:42:26,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:26,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:42:26,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:42:26,419 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:26,455 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-07-19 14:42:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:42:26,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-19 14:42:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:26,456 INFO L225 Difference]: With dead ends: 65 [2022-07-19 14:42:26,457 INFO L226 Difference]: Without dead ends: 57 [2022-07-19 14:42:26,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:42:26,458 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:26,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 88 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-19 14:42:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-07-19 14:42:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-07-19 14:42:26,468 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 40 [2022-07-19 14:42:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:26,468 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-07-19 14:42:26,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-07-19 14:42:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 14:42:26,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:26,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:26,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:26,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 14:42:26,688 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash 705668803, now seen corresponding path program 4 times [2022-07-19 14:42:26,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:26,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076332202] [2022-07-19 14:42:26,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:26,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:42:26,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:26,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076332202] [2022-07-19 14:42:26,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076332202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:26,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069674184] [2022-07-19 14:42:26,750 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 14:42:26,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:26,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:26,752 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:26,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 14:42:26,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 14:42:26,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:42:26,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:42:26,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:42:26,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:42:26,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069674184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:26,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:42:26,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2022-07-19 14:42:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605209089] [2022-07-19 14:42:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:26,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:42:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:42:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:42:26,976 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:27,000 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-07-19 14:42:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:42:27,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-19 14:42:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:27,004 INFO L225 Difference]: With dead ends: 62 [2022-07-19 14:42:27,004 INFO L226 Difference]: Without dead ends: 42 [2022-07-19 14:42:27,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:42:27,007 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:27,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 72 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-19 14:42:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-19 14:42:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-07-19 14:42:27,014 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-07-19 14:42:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:27,014 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-07-19 14:42:27,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-07-19 14:42:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 14:42:27,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:27,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:27,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:27,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 14:42:27,228 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1539543300, now seen corresponding path program 1 times [2022-07-19 14:42:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:27,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612495423] [2022-07-19 14:42:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:27,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:27,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612495423] [2022-07-19 14:42:27,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612495423] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:27,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668296647] [2022-07-19 14:42:27,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:27,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:27,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:27,911 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:27,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 14:42:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:28,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-19 14:42:28,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:28,050 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-19 14:42:28,099 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:42:28,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 14:42:28,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:28,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:42:28,177 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:42:28,177 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 23 treesize of output 26 [2022-07-19 14:42:28,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:28,367 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 20 treesize of output 19 [2022-07-19 14:42:28,535 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:42:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-19 14:42:28,540 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 31 treesize of output 21 [2022-07-19 14:42:28,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:28,544 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 34 treesize of output 36 [2022-07-19 14:42:28,793 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 31 treesize of output 19 [2022-07-19 14:42:28,797 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 19 treesize of output 11 [2022-07-19 14:42:28,824 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 22 treesize of output 10 [2022-07-19 14:42:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:28,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:29,118 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 86 treesize of output 64 [2022-07-19 14:42:29,144 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 86 treesize of output 64 [2022-07-19 14:42:29,156 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_1181 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse0) (<= .cse0 |c_ULTIMATE.start_dll_update_at_~data#1|) (forall ((v_ArrVal_1179 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1179) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)))) is different from false [2022-07-19 14:42:29,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:42:29,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2022-07-19 14:42:29,186 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 17 treesize of output 13 [2022-07-19 14:42:31,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1176 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|))) is different from false [2022-07-19 14:42:33,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|) (forall ((v_ArrVal_1176 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))))) is different from false [2022-07-19 14:42:33,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-07-19 14:42:34,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|))) is different from false [2022-07-19 14:42:34,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (v_ArrVal_1175 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1175) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|))) is different from false [2022-07-19 14:42:34,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:42:34,049 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:42:34,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-19 14:42:34,053 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 45 treesize of output 41 [2022-07-19 14:42:34,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:42:34,057 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 29 treesize of output 25 [2022-07-19 14:42:34,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:42:34,061 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 31 treesize of output 23 [2022-07-19 14:42:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-19 14:42:34,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668296647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:42:34,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:42:34,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 22] total 58 [2022-07-19 14:42:34,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622419171] [2022-07-19 14:42:34,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:34,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-19 14:42:34,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:34,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-19 14:42:34,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2500, Unknown=6, NotChecked=630, Total=3306 [2022-07-19 14:42:34,160 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 58 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 58 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:34,714 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((v_ArrVal_1176 Int) (v_ArrVal_1175 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1175) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2022-07-19 14:42:34,977 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2022-07-19 14:42:35,242 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2022-07-19 14:42:35,506 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|) (forall ((v_ArrVal_1176 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from false [2022-07-19 14:42:35,771 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1176 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|)))) is different from false [2022-07-19 14:42:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:36,323 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-07-19 14:42:36,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 14:42:36,324 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 58 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-19 14:42:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:36,324 INFO L225 Difference]: With dead ends: 48 [2022-07-19 14:42:36,324 INFO L226 Difference]: Without dead ends: 43 [2022-07-19 14:42:36,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=283, Invalid=3532, Unknown=11, NotChecked=1430, Total=5256 [2022-07-19 14:42:36,326 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:36,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 443 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 698 Invalid, 0 Unknown, 236 Unchecked, 0.4s Time] [2022-07-19 14:42:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-19 14:42:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-19 14:42:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-07-19 14:42:36,333 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-07-19 14:42:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:36,334 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-07-19 14:42:36,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 58 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-07-19 14:42:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 14:42:36,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:36,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:36,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:36,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 14:42:36,559 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash 532856157, now seen corresponding path program 2 times [2022-07-19 14:42:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:36,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187227188] [2022-07-19 14:42:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:42:36,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:36,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187227188] [2022-07-19 14:42:36,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187227188] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:36,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768853140] [2022-07-19 14:42:36,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:42:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:36,606 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:42:36,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 14:42:36,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:42:36,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:42:36,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:42:36,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 14:42:36,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 14:42:36,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768853140] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:42:36,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:42:36,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-07-19 14:42:36,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889406431] [2022-07-19 14:42:36,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:36,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:42:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:42:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:42:36,826 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:36,878 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-07-19 14:42:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:42:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-19 14:42:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:36,879 INFO L225 Difference]: With dead ends: 43 [2022-07-19 14:42:36,879 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 14:42:36,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-07-19 14:42:36,880 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:36,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 58 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 14:42:36,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 14:42:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 14:42:36,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-07-19 14:42:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:36,883 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 14:42:36,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:42:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 14:42:36,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 14:42:36,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:42:36,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:37,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 14:42:37,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 14:43:11,116 WARN L233 SmtUtils]: Spent 32.24s on a formula simplification. DAG size of input: 112 DAG size of output: 88 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-19 14:43:27,525 WARN L233 SmtUtils]: Spent 15.86s on a formula simplification. DAG size of input: 66 DAG size of output: 54 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-19 14:43:27,874 INFO L902 garLoopResultBuilder]: At program point myexitENTRY(lines 572 574) the Hoare annotation is: true [2022-07-19 14:43:27,874 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-07-19 14:43:27,874 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 572 574) no Hoare annotation was computed. [2022-07-19 14:43:27,874 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 591) no Hoare annotation was computed. [2022-07-19 14:43:27,874 INFO L899 garLoopResultBuilder]: For program point L589-1(lines 589 591) no Hoare annotation was computed. [2022-07-19 14:43:27,874 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 14:43:27,875 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 14:43:27,875 INFO L902 garLoopResultBuilder]: At program point L590(line 590) the Hoare annotation is: true [2022-07-19 14:43:27,875 INFO L895 garLoopResultBuilder]: At program point L615(lines 610 616) the Hoare annotation is: (let ((.cse18 (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|)) (.cse16 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse16 4)))) (.cse2 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse3 (<= |ULTIMATE.start_dll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (.cse4 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_get_data_at_#res#1|)) (.cse7 (<= |ULTIMATE.start_main_~expected~0#1| .cse18)) (.cse8 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse9 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse10 (<= .cse18 |ULTIMATE.start_main_~expected~0#1|)) (.cse11 (<= |ULTIMATE.start_dll_create_~len#1| 0)) (.cse13 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse14 (= (let ((.cse17 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse16 .cse17)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse17))) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse15 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse11 (<= .cse12 |ULTIMATE.start_main_~len~0#1|) .cse13 .cse14 .cse15 (<= |ULTIMATE.start_main_~len~0#1| .cse12))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~i~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15)))) [2022-07-19 14:43:27,875 INFO L899 garLoopResultBuilder]: For program point L633-2(lines 633 638) no Hoare annotation was computed. [2022-07-19 14:43:27,875 INFO L895 garLoopResultBuilder]: At program point L633-3(lines 633 638) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse10 4)))) (.cse1 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse2 (or (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|)))) (.cse3 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse5 (<= |ULTIMATE.start_dll_create_~len#1| 0)) (.cse7 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse8 (= (let ((.cse11 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse10 .cse11)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse11))) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse6 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 |ULTIMATE.start_main_~len~0#1|) .cse7 .cse8 .cse9 (<= |ULTIMATE.start_main_~len~0#1| .cse6))) (and .cse1 .cse2 .cse3 .cse4 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse5 .cse7) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 1) .cse3 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse4 .cse5 .cse7 .cse8 .cse9)))) [2022-07-19 14:43:27,875 INFO L899 garLoopResultBuilder]: For program point L633-4(lines 633 638) no Hoare annotation was computed. [2022-07-19 14:43:27,876 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 623) no Hoare annotation was computed. [2022-07-19 14:43:27,876 INFO L902 garLoopResultBuilder]: At program point L642(lines 624 643) the Hoare annotation is: true [2022-07-19 14:43:27,876 INFO L895 garLoopResultBuilder]: At program point L601(lines 585 602) the Hoare annotation is: (and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~len~0#1|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) 4) |ULTIMATE.start_dll_create_#res#1.offset|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0)) [2022-07-19 14:43:27,876 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse18 (+ |ULTIMATE.start_main_~len~0#1| 1))) (let ((.cse1 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_update_at_~head#1.offset|)) (.cse11 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse0 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse12 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse13 (<= |ULTIMATE.start_dll_update_at_~data#1| .cse18)) (.cse2 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse15 (<= .cse18 |ULTIMATE.start_dll_update_at_~data#1|)) (.cse5 (<= |ULTIMATE.start_dll_create_~len#1| 0)) (.cse6 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse17 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse7 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) .cse2 (not (= (select .cse3 4) |ULTIMATE.start_dll_update_at_~head#1.base|)) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) .cse4 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_update_at_~index#1|)) .cse5 .cse6 (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_update_at_~data#1| .cse7) (= (select .cse8 4) |ULTIMATE.start_dll_update_at_~head#1.offset|) .cse9 (<= .cse7 |ULTIMATE.start_dll_update_at_~data#1|) .cse10)) (let ((.cse14 (+ |ULTIMATE.start_dll_update_at_~head#1.offset| 4)) (.cse16 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 1 |ULTIMATE.start_dll_update_at_~index#1|) .cse11 .cse0 .cse12 .cse1 (<= |ULTIMATE.start_dll_update_at_~index#1| 1) .cse13 .cse2 (not (= (select .cse3 .cse14) |ULTIMATE.start_main_~s~0#1.base|)) .cse15 .cse5 (<= .cse16 |ULTIMATE.start_main_~len~0#1|) .cse6 (= (select .cse8 .cse14) |ULTIMATE.start_main_~s~0#1.offset|) .cse17 .cse9 .cse10 (<= |ULTIMATE.start_main_~len~0#1| .cse16))) (and .cse11 .cse0 .cse12 (forall ((v_ArrVal_448 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_448) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|)) .cse13 .cse2 (forall ((v_ArrVal_448 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_448) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) .cse4 .cse15 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_dll_update_at_~head#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse5 .cse6 (forall ((v_ArrVal_1181 (Array Int Int))) (= |ULTIMATE.start_dll_update_at_~head#1.offset| (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1181) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) .cse17 .cse10)))) [2022-07-19 14:43:27,876 INFO L899 garLoopResultBuilder]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2022-07-19 14:43:27,876 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 14:43:27,877 INFO L899 garLoopResultBuilder]: For program point L635(lines 635 637) no Hoare annotation was computed. [2022-07-19 14:43:27,877 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 641) no Hoare annotation was computed. [2022-07-19 14:43:27,877 INFO L895 garLoopResultBuilder]: At program point L611-2(lines 611 614) the Hoare annotation is: (let ((.cse19 (select (select |#memory_int| |ULTIMATE.start_dll_get_data_at_~head#1.base|) |ULTIMATE.start_dll_get_data_at_~head#1.offset|)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse4 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse17 4)))) (.cse2 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse3 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (<= |ULTIMATE.start_main_~expected~0#1| .cse19)) (.cse7 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse8 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse9 (<= .cse19 |ULTIMATE.start_main_~expected~0#1|)) (.cse10 (<= |ULTIMATE.start_dll_create_~len#1| 0)) (.cse11 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse12 (= (let ((.cse18 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse17 .cse18)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse18))) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse13 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|))) (and (<= 1 |ULTIMATE.start_dll_get_data_at_~index#1|) .cse0 (= (let ((.cse15 (+ |ULTIMATE.start_dll_get_data_at_~head#1.offset| 4))) (select (select |#memory_int| (select .cse14 .cse15)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_get_data_at_~head#1.base|) .cse15))) |ULTIMATE.start_main_~expected~0#1|) .cse1 .cse2 (not (= |ULTIMATE.start_dll_get_data_at_~head#1.base| (select .cse14 4))) .cse3 (= |ULTIMATE.start_dll_get_data_at_~head#1.offset| 0) .cse4 .cse5 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 1) .cse7 .cse8 .cse10 .cse11 .cse12 .cse13)) (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse10 (<= .cse16 |ULTIMATE.start_main_~len~0#1|) .cse11 .cse12 .cse13 (<= |ULTIMATE.start_main_~len~0#1| .cse16)))))) [2022-07-19 14:43:27,877 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 14:43:27,877 INFO L899 garLoopResultBuilder]: For program point L611-3(lines 611 614) no Hoare annotation was computed. [2022-07-19 14:43:27,877 INFO L895 garLoopResultBuilder]: At program point L636(lines 624 643) the Hoare annotation is: false [2022-07-19 14:43:27,877 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 609) no Hoare annotation was computed. [2022-07-19 14:43:27,878 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2022-07-19 14:43:27,878 INFO L899 garLoopResultBuilder]: For program point L595-2(lines 595 597) no Hoare annotation was computed. [2022-07-19 14:43:27,878 INFO L895 garLoopResultBuilder]: At program point L587-2(lines 587 600) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (let ((.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (not .cse5)) (.cse3 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse4 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (or (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 1 |ULTIMATE.start_dll_create_~len#1|) .cse2 .cse3 .cse4 (<= |ULTIMATE.start_dll_create_~len#1| 1)) (and .cse2 .cse4 .cse5 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|)) (and .cse0 (<= 2 |ULTIMATE.start_main_~len~0#1|) .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) .cse3 .cse4 (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (< |ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|))))))) [2022-07-19 14:43:27,878 INFO L899 garLoopResultBuilder]: For program point L587-3(lines 587 600) no Hoare annotation was computed. [2022-07-19 14:43:27,878 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-07-19 14:43:27,878 INFO L899 garLoopResultBuilder]: For program point L629-2(lines 629 632) no Hoare annotation was computed. [2022-07-19 14:43:27,879 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 632) the Hoare annotation is: (let ((.cse13 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse9 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse7 4)))) (.cse1 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))) (.cse2 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| (select .cse9 4))) (.cse4 (<= |ULTIMATE.start_dll_create_~len#1| 0)) (.cse5 (<= .cse13 |ULTIMATE.start_main_~len~0#1|)) (.cse6 (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse11 (<= |ULTIMATE.start_main_~len~0#1| .cse13))) (or (and (<= 2 |ULTIMATE.start_main_~len~0#1|) .cse0 .cse1 .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 .cse6 (= (let ((.cse8 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse7 .cse8)) (select .cse9 .cse8))) (+ |ULTIMATE.start_main_~len~0#1| 1)) .cse10 .cse11) (and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) .cse1 (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) .cse2 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_22| Int)) (or (and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1176 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_22| v_ArrVal_1176) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)))) (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_22|))) .cse12 .cse4 .cse6 (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse10) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse10 .cse11)))) [2022-07-19 14:43:27,879 INFO L899 garLoopResultBuilder]: For program point L629-4(lines 629 632) no Hoare annotation was computed. [2022-07-19 14:43:27,882 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:43:27,883 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:43:27,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] [2022-07-19 14:43:27,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:27,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:27,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] [2022-07-19 14:43:27,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:27,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:27,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,941 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] [2022-07-19 14:43:27,942 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:27,942 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:27,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,944 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] [2022-07-19 14:43:27,945 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:27,945 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:27,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] [2022-07-19 14:43:27,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] [2022-07-19 14:43:27,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,959 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1181,QUANTIFIED] [2022-07-19 14:43:27,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,963 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] [2022-07-19 14:43:27,963 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] [2022-07-19 14:43:27,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:27,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:27,964 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1181,QUANTIFIED] [2022-07-19 14:43:27,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:43:27 BoogieIcfgContainer [2022-07-19 14:43:27,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:43:27,966 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:43:27,966 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:43:27,966 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:43:27,967 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:42:16" (3/4) ... [2022-07-19 14:43:27,969 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 14:43:27,975 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2022-07-19 14:43:27,980 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-19 14:43:27,981 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-19 14:43:27,981 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 14:43:27,981 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 14:43:28,012 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((new_head == 0 && 2 <= len) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && len <= 2) && !(\result == #memory_$Pointer$[\result][4])) && #memory_$Pointer$[\result][4] == \result) && len <= 0) && !(new_head == 0)) && \result == 0) && head == 0 [2022-07-19 14:43:28,013 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 <= len && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && len <= 2) && index <= 0) && 2 <= i) && len <= 0) && unknown-#memory_int-unknown[s][s] <= len) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) || (((((((((((((new_head == 0 && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && len <= 2) && 2 + i <= len) && !(\result == #memory_$Pointer$[\result][4])) && (forall v_ULTIMATE.start_dll_update_at_~head#1.offset_22 : int :: ((i <= 0 && 0 <= i) && (forall v_ArrVal_1176 : int :: !(#memory_$Pointer$[s][v_ULTIMATE.start_dll_update_at_~head#1.offset_22 := v_ArrVal_1176][s + 4] == s))) || s < v_ULTIMATE.start_dll_update_at_~head#1.offset_22)) && s == #memory_$Pointer$[s][4]) && len <= 0) && !(new_head == 0)) && \result == 0) && head == 0) && s == 0)) || (((((((((((!(s == #memory_$Pointer$[s][4]) && !(head == 0)) && 1 <= i) && i + 1 <= len) && len <= 2) && index <= 0) && s == #memory_$Pointer$[s][4]) && len <= 0) && unknown-#memory_int-unknown[s][s] <= len) && !(new_head == 0)) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) [2022-07-19 14:43:28,013 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((new_head == 0 && i == 0) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && s == head) && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && len <= 2) && !(#memory_$Pointer$[head][4] == head)) && !(\result == #memory_$Pointer$[\result][4])) && index <= 0) && 2 + i <= len + index) && len <= 0) && !(new_head == 0)) && \result == 0) && head == 0) && data <= len + i) && #memory_$Pointer$[head][4] == head) && s == head) && len + i <= data) && s == 0) || (((((((((((((((((1 <= index && 2 <= len) && !(head == 0)) && 1 <= i) && s == head) && index <= 1) && data <= len + 1) && len <= 2) && !(#memory_$Pointer$[head][head + 4] == s)) && len + 1 <= data) && len <= 0) && unknown-#memory_int-unknown[s][s] <= len) && !(new_head == 0)) && #memory_$Pointer$[head][head + 4] == s) && i <= 1) && s == head) && s == 0) && len <= unknown-#memory_int-unknown[s][s])) || (((((((((((((((2 <= len && !(head == 0)) && 1 <= i) && (forall v_ArrVal_448 : [int]int :: unknown-#memory_int-unknown[head := v_ArrVal_448][s][s] <= len)) && data <= len + 1) && len <= 2) && (forall v_ArrVal_448 : [int]int :: len <= unknown-#memory_int-unknown[head := v_ArrVal_448][s][s])) && index <= 0) && len + 1 <= data) && #memory_$Pointer$[s][s + 4] == head) && s == #memory_$Pointer$[s][4]) && len <= 0) && !(new_head == 0)) && (forall v_ArrVal_1181 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_1181][s][s + 4])) && i <= 1) && s == 0) [2022-07-19 14:43:28,014 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= len && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \result <= expected) && i + 1 <= len) && len <= 2) && expected <= \result) && expected <= unknown-#memory_int-unknown[head][head]) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[head][head] <= expected) && index == 0) && len <= 0) && unknown-#memory_int-unknown[s][s] <= len) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) || (((((((((((((((2 <= len && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \result <= expected) && i + 1 <= len) && i == 1) && len <= 2) && expected <= \result) && expected <= unknown-#memory_int-unknown[head][head]) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[head][head] <= expected) && len <= 0) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) [2022-07-19 14:43:28,033 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:43:28,033 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:43:28,034 INFO L158 Benchmark]: Toolchain (without parser) took 71954.67ms. Allocated memory was 104.9MB in the beginning and 186.6MB in the end (delta: 81.8MB). Free memory was 70.6MB in the beginning and 159.0MB in the end (delta: -88.4MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2022-07-19 14:43:28,035 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 79.7MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:43:28,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.47ms. Allocated memory is still 104.9MB. Free memory was 70.4MB in the beginning and 73.3MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 14:43:28,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.83ms. Allocated memory is still 104.9MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:43:28,036 INFO L158 Benchmark]: Boogie Preprocessor took 24.36ms. Allocated memory is still 104.9MB. Free memory was 71.2MB in the beginning and 69.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:43:28,036 INFO L158 Benchmark]: RCFGBuilder took 418.09ms. Allocated memory is still 104.9MB. Free memory was 69.7MB in the beginning and 55.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 14:43:28,036 INFO L158 Benchmark]: TraceAbstraction took 71005.90ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 55.3MB in the beginning and 41.1MB in the end (delta: 14.2MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2022-07-19 14:43:28,036 INFO L158 Benchmark]: Witness Printer took 67.27ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 41.1MB in the beginning and 159.0MB in the end (delta: -117.9MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2022-07-19 14:43:28,041 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.20ms. Allocated memory is still 79.7MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.47ms. Allocated memory is still 104.9MB. Free memory was 70.4MB in the beginning and 73.3MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.83ms. Allocated memory is still 104.9MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.36ms. Allocated memory is still 104.9MB. Free memory was 71.2MB in the beginning and 69.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 418.09ms. Allocated memory is still 104.9MB. Free memory was 69.7MB in the beginning and 55.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 71005.90ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 55.3MB in the beginning and 41.1MB in the end (delta: 14.2MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. * Witness Printer took 67.27ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 41.1MB in the beginning and 159.0MB in the end (delta: -117.9MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1181,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1181,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 641]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.9s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 50.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 919 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 919 mSDsluCounter, 2012 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 620 IncrementalHoareTripleChecker+Unchecked, 1601 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1925 IncrementalHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 411 mSDtfsCounter, 1925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 878 GetRequests, 637 SyntacticMatches, 16 SemanticMatches, 225 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 2566 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=11, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 216 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 33 NumberOfFragments, 1317 HoareAnnotationTreeSize, 13 FomulaSimplifications, 18845 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 13 FomulaSimplificationsInter, 14920 FormulaSimplificationTreeSizeReductionInter, 49.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 893 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1161 ConstructedInterpolants, 19 QuantifiedInterpolants, 6444 SizeOfPredicates, 87 NumberOfNonLiveVariables, 3115 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 37 InterpolantComputations, 7 PerfectInterpolantSequences, 397/582 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 633]: Loop Invariant [2022-07-19 14:43:28,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((i == 0 && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && ((2 + i <= len && 0 <= i) || (2 <= len && 1 <= i))) && len <= 2) && index <= 0) && len <= 0) && unknown-#memory_int-unknown[s][s] <= len) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) || ((((((!(head == 0) && ((2 + i <= len && 0 <= i) || (2 <= len && 1 <= i))) && len <= 2) && index <= 0) && 2 <= i) && len <= 0) && !(new_head == 0))) || ((((((((((!(s == #memory_$Pointer$[s][4]) && !(head == 0)) && ((2 + i <= len && 0 <= i) || (2 <= len && 1 <= i))) && i == 1) && len <= 2) && index <= 0) && index <= 0) && len <= 0) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) - InvariantResult [Line: 611]: Loop Invariant [2022-07-19 14:43:28,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,078 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((2 <= len && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && i + 1 <= len) && i == 1) && len <= 2) && index <= 0) && expected <= unknown-#memory_int-unknown[head][head]) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[head][head] <= expected) && len <= 0) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) || ((((((((((((((((1 <= index && 2 <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == expected) && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && i + 1 <= len) && head == 0) && i == 1) && len <= 2) && index <= 1) && index <= 0) && 0 <= i) && len <= 0) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0)) || (((((((((((((((2 <= len && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && i + 1 <= len) && len <= 2) && expected <= unknown-#memory_int-unknown[head][head]) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[head][head] <= expected) && index == 0) && len <= 0) && unknown-#memory_int-unknown[s][s] <= len) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 587]: Loop Invariant [2022-07-19 14:43:28,088 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,088 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,089 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] [2022-07-19 14:43:28,090 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:28,090 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:28,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,091 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] [2022-07-19 14:43:28,091 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:28,091 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] Derived loop invariant: (((((((((new_head == 0 && !(head == 0)) && \valid[head] == 1) && \valid[new_head] == 1) && 1 <= len) && len == 2) && !(new_head == 0)) && head == 0) && len <= 1) || (((len == 2 && head == 0) && head == 0) && len == len)) || (((((((((new_head == 0 && 2 <= len) && !(head == 0)) && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && #memory_$Pointer$[head][4] == head) && len <= 2) && len <= 0) && !(new_head == 0)) && head == 0) && (forall v_ArrVal_1176 : int, v_ULTIMATE.start_dll_update_at_~head#1.offset_22 : int :: !(head == #memory_$Pointer$[head][v_ULTIMATE.start_dll_update_at_~head#1.offset_22 := v_ArrVal_1176][head + 4]) || head < v_ULTIMATE.start_dll_update_at_~head#1.offset_22)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 610]: Loop Invariant [2022-07-19 14:43:28,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,098 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,098 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((2 <= len && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \result <= expected) && i + 1 <= len) && len <= 2) && expected <= \result) && expected <= unknown-#memory_int-unknown[head][head]) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[head][head] <= expected) && index == 0) && len <= 0) && unknown-#memory_int-unknown[s][s] <= len) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) || (((((((((((((((2 <= len && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && \result <= expected) && i + 1 <= len) && i == 1) && len <= 2) && expected <= \result) && expected <= unknown-#memory_int-unknown[head][head]) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[head][head] <= expected) && len <= 0) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) - InvariantResult [Line: 629]: Loop Invariant [2022-07-19 14:43:28,099 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,099 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,099 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,100 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] [2022-07-19 14:43:28,100 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:28,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:28,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1176,QUANTIFIED] [2022-07-19 14:43:28,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:28,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_update_at_~head#1.offset_22,QUANTIFIED] [2022-07-19 14:43:28,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((2 <= len && !(s == #memory_$Pointer$[s][4])) && !(head == 0)) && len <= 2) && index <= 0) && 2 <= i) && len <= 0) && unknown-#memory_int-unknown[s][s] <= len) && !(new_head == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) || (((((((((((((new_head == 0 && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && len <= 2) && 2 + i <= len) && !(\result == #memory_$Pointer$[\result][4])) && (forall v_ULTIMATE.start_dll_update_at_~head#1.offset_22 : int :: ((i <= 0 && 0 <= i) && (forall v_ArrVal_1176 : int :: !(#memory_$Pointer$[s][v_ULTIMATE.start_dll_update_at_~head#1.offset_22 := v_ArrVal_1176][s + 4] == s))) || s < v_ULTIMATE.start_dll_update_at_~head#1.offset_22)) && s == #memory_$Pointer$[s][4]) && len <= 0) && !(new_head == 0)) && \result == 0) && head == 0) && s == 0)) || (((((((((((!(s == #memory_$Pointer$[s][4]) && !(head == 0)) && 1 <= i) && i + 1 <= len) && len <= 2) && index <= 0) && s == #memory_$Pointer$[s][4]) && len <= 0) && unknown-#memory_int-unknown[s][s] <= len) && !(new_head == 0)) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) - InvariantResult [Line: 585]: Loop Invariant [2022-07-19 14:43:28,106 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,106 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((new_head == 0 && 2 <= len) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && len <= 2) && !(\result == #memory_$Pointer$[\result][4])) && #memory_$Pointer$[\result][4] == \result) && len <= 0) && !(new_head == 0)) && \result == 0) && head == 0 - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2022-07-19 14:43:28,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,111 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] [2022-07-19 14:43:28,111 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] [2022-07-19 14:43:28,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,112 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1181,QUANTIFIED] [2022-07-19 14:43:28,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,115 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] [2022-07-19 14:43:28,115 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_448,QUANTIFIED] [2022-07-19 14:43:28,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:43:28,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:43:28,116 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1181,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((new_head == 0 && i == 0) && !(head == 0)) && !(head == #memory_$Pointer$[head][4])) && s == head) && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && len <= 2) && !(#memory_$Pointer$[head][4] == head)) && !(\result == #memory_$Pointer$[\result][4])) && index <= 0) && 2 + i <= len + index) && len <= 0) && !(new_head == 0)) && \result == 0) && head == 0) && data <= len + i) && #memory_$Pointer$[head][4] == head) && s == head) && len + i <= data) && s == 0) || (((((((((((((((((1 <= index && 2 <= len) && !(head == 0)) && 1 <= i) && s == head) && index <= 1) && data <= len + 1) && len <= 2) && !(#memory_$Pointer$[head][head + 4] == s)) && len + 1 <= data) && len <= 0) && unknown-#memory_int-unknown[s][s] <= len) && !(new_head == 0)) && #memory_$Pointer$[head][head + 4] == s) && i <= 1) && s == head) && s == 0) && len <= unknown-#memory_int-unknown[s][s])) || (((((((((((((((2 <= len && !(head == 0)) && 1 <= i) && (forall v_ArrVal_448 : [int]int :: unknown-#memory_int-unknown[head := v_ArrVal_448][s][s] <= len)) && data <= len + 1) && len <= 2) && (forall v_ArrVal_448 : [int]int :: len <= unknown-#memory_int-unknown[head := v_ArrVal_448][s][s])) && index <= 0) && len + 1 <= data) && #memory_$Pointer$[s][s + 4] == head) && s == #memory_$Pointer$[s][4]) && len <= 0) && !(new_head == 0)) && (forall v_ArrVal_1181 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_1181][s][s + 4])) && i <= 1) && s == 0) RESULT: Ultimate proved your program to be correct! [2022-07-19 14:43:28,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE