./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_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/dll2c_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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:38:40,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:38:40,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:38:40,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:38:40,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:38:40,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:38:40,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:38:40,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:38:40,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:38:40,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:38:40,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:38:40,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:38:40,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:38:40,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:38:40,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:38:40,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:38:40,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:38:40,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:38:40,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:38:40,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:38:40,320 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:38:40,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:38:40,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:38:40,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:38:40,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:38:40,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:38:40,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:38:40,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:38:40,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:38:40,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:38:40,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:38:40,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:38:40,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:38:40,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:38:40,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:38:40,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:38:40,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:38:40,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:38:40,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:38:40,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:38:40,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:38:40,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:38:40,334 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:38:40,363 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:38:40,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:38:40,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:38:40,364 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:38:40,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:38:40,364 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:38:40,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:38:40,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:38:40,365 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:38:40,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:38:40,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:38:40,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:38:40,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:38:40,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:38:40,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:38:40,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:38:40,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:38:40,367 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:38:40,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:38:40,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:38:40,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:38:40,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:38:40,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:38:40,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:38:40,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:38:40,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:38:40,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:38:40,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:38:40,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:38:40,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:38:40,370 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:38:40,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:38:40,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:38:40,370 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2022-07-19 14:38:40,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:38:40,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:38:40,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:38:40,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:38:40,602 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:38:40,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-07-19 14:38:40,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dd820933/afbb8d14db15492183b514b3c5b820be/FLAG27bfc1959 [2022-07-19 14:38:41,003 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:38:41,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-07-19 14:38:41,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dd820933/afbb8d14db15492183b514b3c5b820be/FLAG27bfc1959 [2022-07-19 14:38:41,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dd820933/afbb8d14db15492183b514b3c5b820be [2022-07-19 14:38:41,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:38:41,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:38:41,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:38:41,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:38:41,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:38:41,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:38:41" (1/1) ... [2022-07-19 14:38:41,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54148510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41, skipping insertion in model container [2022-07-19 14:38:41,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:38:41" (1/1) ... [2022-07-19 14:38:41,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:38:41,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:38:41,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2022-07-19 14:38:41,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:38:41,664 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:38:41,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2022-07-19 14:38:41,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:38:41,709 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:38:41,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41 WrapperNode [2022-07-19 14:38:41,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:38:41,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:38:41,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:38:41,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:38:41,717 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:38:41" (1/1) ... [2022-07-19 14:38:41,726 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:38:41" (1/1) ... [2022-07-19 14:38:41,741 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-07-19 14:38:41,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:38:41,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:38:41,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:38:41,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:38:41,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41" (1/1) ... [2022-07-19 14:38:41,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41" (1/1) ... [2022-07-19 14:38:41,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41" (1/1) ... [2022-07-19 14:38:41,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41" (1/1) ... [2022-07-19 14:38:41,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41" (1/1) ... [2022-07-19 14:38:41,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41" (1/1) ... [2022-07-19 14:38:41,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41" (1/1) ... [2022-07-19 14:38:41,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:38:41,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:38:41,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:38:41,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:38:41,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41" (1/1) ... [2022-07-19 14:38:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:38:41,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:38:41,825 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:38:41,843 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:38:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:38:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:38:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-19 14:38:41,858 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-19 14:38:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:38:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:38:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:38:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:38:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:38:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:38:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:38:41,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:38:41,927 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:38:41,928 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:38:42,106 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:38:42,110 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:38:42,110 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-19 14:38:42,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:38:42 BoogieIcfgContainer [2022-07-19 14:38:42,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:38:42,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:38:42,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:38:42,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:38:42,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:38:41" (1/3) ... [2022-07-19 14:38:42,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bba66ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:38:42, skipping insertion in model container [2022-07-19 14:38:42,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:41" (2/3) ... [2022-07-19 14:38:42,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bba66ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:38:42, skipping insertion in model container [2022-07-19 14:38:42,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:38:42" (3/3) ... [2022-07-19 14:38:42,118 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2022-07-19 14:38:42,128 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:38:42,128 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:38:42,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:38:42,177 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@65e5bff3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@43e2dd94 [2022-07-19 14:38:42,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:38:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:38:42,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:42,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:42,193 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-07-19 14:38:42,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:38:42,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934672387] [2022-07-19 14:38:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:38:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:42,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:38:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:42,344 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:38:42,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:38:42,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934672387] [2022-07-19 14:38:42,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934672387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:38:42,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:38:42,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:38:42,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544275335] [2022-07-19 14:38:42,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:38:42,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:38:42,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:38:42,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:38:42,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:38:42,369 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:38:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:42,415 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-07-19 14:38:42,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:38:42,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-19 14:38:42,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:42,424 INFO L225 Difference]: With dead ends: 63 [2022-07-19 14:38:42,424 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 14:38:42,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:38:42,430 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:38:42,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:38:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 14:38:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-19 14:38:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-19 14:38:42,471 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-07-19 14:38:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:42,473 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-19 14:38:42,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:38:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-19 14:38:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:38:42,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:42,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:42,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:38:42,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-07-19 14:38:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:38:42,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666376903] [2022-07-19 14:38:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:38:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:38:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:42,555 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:38:42,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:38:42,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666376903] [2022-07-19 14:38:42,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666376903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:38:42,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:38:42,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:38:42,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805050734] [2022-07-19 14:38:42,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:38:42,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:38:42,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:38:42,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:38:42,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:38:42,558 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:38:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:42,586 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-07-19 14:38:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:38:42,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-19 14:38:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:42,589 INFO L225 Difference]: With dead ends: 51 [2022-07-19 14:38:42,589 INFO L226 Difference]: Without dead ends: 35 [2022-07-19 14:38:42,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:38:42,594 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:38:42,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:38:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-19 14:38:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-19 14:38:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-19 14:38:42,604 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-07-19 14:38:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:42,606 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-19 14:38:42,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:38:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-19 14:38:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 14:38:42,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:42,610 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, 1, 1] [2022-07-19 14:38:42,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:38:42,610 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:42,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:42,612 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-07-19 14:38:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:38:42,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875647716] [2022-07-19 14:38:42,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:42,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:38:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:42,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:38:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:38:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:42,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:38:42,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875647716] [2022-07-19 14:38:42,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875647716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:38:42,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:38:42,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:38:42,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462563565] [2022-07-19 14:38:42,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:38:42,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:38:42,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:38:42,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:38:42,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:38:42,764 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:42,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:42,816 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-07-19 14:38:42,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:38:42,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-19 14:38:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:42,817 INFO L225 Difference]: With dead ends: 53 [2022-07-19 14:38:42,817 INFO L226 Difference]: Without dead ends: 44 [2022-07-19 14:38:42,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:38:42,818 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:38:42,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 74 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:38:42,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-19 14:38:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-07-19 14:38:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-19 14:38:42,823 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-07-19 14:38:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:42,824 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-19 14:38:42,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-19 14:38:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:38:42,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:42,825 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:42,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:38:42,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:42,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:42,826 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-07-19 14:38:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:38:42,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417061305] [2022-07-19 14:38:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:38:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:42,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:38:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:38:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:38:42,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417061305] [2022-07-19 14:38:42,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417061305] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:38:42,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250184553] [2022-07-19 14:38:42,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:42,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:38:42,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:38:42,981 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:38:42,987 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:38:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:43,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:38:43,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:43,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:38:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:43,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250184553] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:38:43,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:38:43,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-19 14:38:43,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110012881] [2022-07-19 14:38:43,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:38:43,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:38:43,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:38:43,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:38:43,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:38:43,298 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:38:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:43,352 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-07-19 14:38:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:38:43,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-07-19 14:38:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:43,354 INFO L225 Difference]: With dead ends: 55 [2022-07-19 14:38:43,354 INFO L226 Difference]: Without dead ends: 46 [2022-07-19 14:38:43,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:38:43,355 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 93 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:38:43,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 136 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:38:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-19 14:38:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-07-19 14:38:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-07-19 14:38:43,360 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2022-07-19 14:38:43,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:43,360 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-07-19 14:38:43,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:38:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-07-19 14:38:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 14:38:43,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:43,361 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, 1, 1, 1, 1, 1] [2022-07-19 14:38:43,381 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:38:43,578 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:38:43,578 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:43,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:43,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1120694760, now seen corresponding path program 2 times [2022-07-19 14:38:43,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:38:43,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369249909] [2022-07-19 14:38:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:38:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:38:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:38:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:43,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:38:43,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369249909] [2022-07-19 14:38:43,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369249909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:38:43,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809727844] [2022-07-19 14:38:43,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:38:43,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:38:43,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:38:43,708 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:38:43,713 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:38:43,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:38:43,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:38:43,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:38:43,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:43,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:38:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:43,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809727844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:38:43,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:38:43,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-07-19 14:38:43,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816214142] [2022-07-19 14:38:43,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:38:43,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:38:43,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:38:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:38:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:38:43,925 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:43,967 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-07-19 14:38:43,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:38:43,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-07-19 14:38:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:43,969 INFO L225 Difference]: With dead ends: 60 [2022-07-19 14:38:43,969 INFO L226 Difference]: Without dead ends: 46 [2022-07-19 14:38:43,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:38:43,970 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 32 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:38:43,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 156 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:38:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-19 14:38:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2022-07-19 14:38:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-07-19 14:38:43,974 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 40 [2022-07-19 14:38:43,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:43,975 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-07-19 14:38:43,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-07-19 14:38:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 14:38:43,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:43,976 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, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:43,999 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:38:44,197 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:38:44,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:44,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:44,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2115896417, now seen corresponding path program 1 times [2022-07-19 14:38:44,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:38:44,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350533712] [2022-07-19 14:38:44,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:44,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:38:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:44,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:38:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:44,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:38:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:38:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:38:44,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350533712] [2022-07-19 14:38:44,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350533712] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:38:44,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87180625] [2022-07-19 14:38:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:44,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:38:44,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:38:44,733 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:38:44,734 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:38:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:44,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-19 14:38:44,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:44,883 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:38:44,980 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:38:44,981 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:38:45,012 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:38:45,057 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:38:45,058 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 26 treesize of output 27 [2022-07-19 14:38:45,146 INFO L356 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-07-19 14:38:45,148 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:38:45,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 14:38:45,382 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:38:45,383 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_44| input size 40 context size 40 output size 40 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 14:38:45,387 INFO L158 Benchmark]: Toolchain (without parser) took 3996.31ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 84.9MB in the beginning and 78.0MB in the end (delta: 6.9MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2022-07-19 14:38:45,387 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:38:45,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.61ms. Allocated memory is still 115.3MB. Free memory was 84.6MB in the beginning and 80.7MB in the end (delta: 3.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2022-07-19 14:38:45,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.68ms. Allocated memory is still 115.3MB. Free memory was 80.7MB in the beginning and 78.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:38:45,388 INFO L158 Benchmark]: Boogie Preprocessor took 20.11ms. Allocated memory is still 115.3MB. Free memory was 78.4MB in the beginning and 76.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:38:45,388 INFO L158 Benchmark]: RCFGBuilder took 349.36ms. Allocated memory is still 115.3MB. Free memory was 76.9MB in the beginning and 62.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 14:38:45,388 INFO L158 Benchmark]: TraceAbstraction took 3273.07ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 62.2MB in the beginning and 78.0MB in the end (delta: -15.8MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-07-19 14:38:45,389 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.16ms. Allocated memory is still 115.3MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.61ms. Allocated memory is still 115.3MB. Free memory was 84.6MB in the beginning and 80.7MB in the end (delta: 3.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.68ms. Allocated memory is still 115.3MB. Free memory was 80.7MB in the beginning and 78.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.11ms. Allocated memory is still 115.3MB. Free memory was 78.4MB in the beginning and 76.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 349.36ms. Allocated memory is still 115.3MB. Free memory was 76.9MB in the beginning and 62.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3273.07ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 62.2MB in the beginning and 78.0MB in the end (delta: -15.8MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_44| input size 40 context size 40 output size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_44| input size 40 context size 40 output size 40: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:38:45,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:38:47,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:38:47,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:38:47,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:38:47,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:38:47,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:38:47,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:38:47,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:38:47,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:38:47,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:38:47,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:38:47,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:38:47,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:38:47,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:38:47,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:38:47,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:38:47,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:38:47,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:38:47,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:38:47,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:38:47,249 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:38:47,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:38:47,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:38:47,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:38:47,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:38:47,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:38:47,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:38:47,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:38:47,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:38:47,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:38:47,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:38:47,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:38:47,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:38:47,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:38:47,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:38:47,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:38:47,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:38:47,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:38:47,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:38:47,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:38:47,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:38:47,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:38:47,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:38:47,288 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:38:47,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:38:47,289 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:38:47,289 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:38:47,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:38:47,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:38:47,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:38:47,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:38:47,290 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:38:47,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:38:47,295 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:38:47,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:38:47,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:38:47,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:38:47,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:38:47,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:38:47,296 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:38:47,296 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:38:47,296 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:38:47,296 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:38:47,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:38:47,296 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:38:47,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:38:47,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:38:47,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:38:47,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:38:47,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:38:47,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:38:47,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:38:47,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:38:47,298 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:38:47,298 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:38:47,298 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:38:47,298 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:38:47,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:38:47,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:38:47,299 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2022-07-19 14:38:47,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:38:47,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:38:47,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:38:47,603 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:38:47,604 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:38:47,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-07-19 14:38:47,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9177e7652/dc73c79ecbd54987a74927700b179d58/FLAGb3f7eb200 [2022-07-19 14:38:48,032 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:38:48,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-07-19 14:38:48,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9177e7652/dc73c79ecbd54987a74927700b179d58/FLAGb3f7eb200 [2022-07-19 14:38:48,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9177e7652/dc73c79ecbd54987a74927700b179d58 [2022-07-19 14:38:48,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:38:48,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:38:48,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:38:48,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:38:48,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:38:48,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:38:48" (1/1) ... [2022-07-19 14:38:48,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4920d9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48, skipping insertion in model container [2022-07-19 14:38:48,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:38:48" (1/1) ... [2022-07-19 14:38:48,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:38:48,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:38:48,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2022-07-19 14:38:48,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:38:48,733 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:38:48,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2022-07-19 14:38:48,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:38:48,803 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:38:48,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48 WrapperNode [2022-07-19 14:38:48,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:38:48,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:38:48,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:38:48,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:38:48,809 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:38:48" (1/1) ... [2022-07-19 14:38:48,836 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:38:48" (1/1) ... [2022-07-19 14:38:48,859 INFO L137 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-07-19 14:38:48,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:38:48,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:38:48,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:38:48,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:38:48,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48" (1/1) ... [2022-07-19 14:38:48,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48" (1/1) ... [2022-07-19 14:38:48,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48" (1/1) ... [2022-07-19 14:38:48,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48" (1/1) ... [2022-07-19 14:38:48,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48" (1/1) ... [2022-07-19 14:38:48,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48" (1/1) ... [2022-07-19 14:38:48,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48" (1/1) ... [2022-07-19 14:38:48,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:38:48,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:38:48,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:38:48,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:38:48,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48" (1/1) ... [2022-07-19 14:38:48,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:38:48,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:38:48,935 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:38:48,978 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:38:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:38:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-19 14:38:48,990 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-19 14:38:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:38:48,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:38:48,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:38:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:38:48,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:38:49,115 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:38:49,116 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:38:49,310 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:38:49,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:38:49,315 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-19 14:38:49,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:38:49 BoogieIcfgContainer [2022-07-19 14:38:49,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:38:49,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:38:49,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:38:49,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:38:49,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:38:48" (1/3) ... [2022-07-19 14:38:49,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f6ce10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:38:49, skipping insertion in model container [2022-07-19 14:38:49,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:38:48" (2/3) ... [2022-07-19 14:38:49,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f6ce10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:38:49, skipping insertion in model container [2022-07-19 14:38:49,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:38:49" (3/3) ... [2022-07-19 14:38:49,321 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2022-07-19 14:38:49,330 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:38:49,331 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:38:49,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:38:49,369 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@277983bc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4914ddad [2022-07-19 14:38:49,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:38:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:38:49,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:49,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:49,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-07-19 14:38:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:38:49,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265752757] [2022-07-19 14:38:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:49,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:38:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:38:49,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:38:49,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 14:38:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:49,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:38:49,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:49,585 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:38:49,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:38:49,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:38:49,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265752757] [2022-07-19 14:38:49,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265752757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:38:49,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:38:49,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:38:49,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503591702] [2022-07-19 14:38:49,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:38:49,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:38:49,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:38:49,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:38:49,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:38:49,645 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:38:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:49,662 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-07-19 14:38:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:38:49,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-19 14:38:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:49,669 INFO L225 Difference]: With dead ends: 63 [2022-07-19 14:38:49,669 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 14:38:49,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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:38:49,681 INFO L413 NwaCegarLoop]: 48 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, 48 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:38:49,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:38:49,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 14:38:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-19 14:38:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-19 14:38:49,709 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-07-19 14:38:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:49,711 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-19 14:38:49,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:38:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-19 14:38:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:38:49,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:49,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:49,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:38:49,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:38:49,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-07-19 14:38:49,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:38:49,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148323859] [2022-07-19 14:38:49,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:49,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:38:49,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:38:49,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:38:49,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 14:38:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:50,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:38:50,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:50,055 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:38:50,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:38:50,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:38:50,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148323859] [2022-07-19 14:38:50,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148323859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:38:50,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:38:50,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:38:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787868136] [2022-07-19 14:38:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:38:50,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:38:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:38:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:38:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:38:50,058 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:38:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:50,068 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-07-19 14:38:50,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:38:50,069 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-19 14:38:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:50,070 INFO L225 Difference]: With dead ends: 51 [2022-07-19 14:38:50,070 INFO L226 Difference]: Without dead ends: 35 [2022-07-19 14:38:50,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:38:50,071 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 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:38:50,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:38:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-19 14:38:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-19 14:38:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-19 14:38:50,076 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-07-19 14:38:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:50,076 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-19 14:38:50,077 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:38:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-19 14:38:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 14:38:50,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:50,078 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, 1, 1] [2022-07-19 14:38:50,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-19 14:38:50,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:38:50,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:50,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-07-19 14:38:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:38:50,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468397818] [2022-07-19 14:38:50,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:50,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:38:50,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:38:50,295 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:38:50,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 14:38:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:50,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:38:50,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:50,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:38:50,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:38:50,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468397818] [2022-07-19 14:38:50,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468397818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:38:50,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:38:50,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:38:50,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049657377] [2022-07-19 14:38:50,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:38:50,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:38:50,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:38:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:38:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:38:50,450 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:50,474 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-07-19 14:38:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:38:50,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-19 14:38:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:50,475 INFO L225 Difference]: With dead ends: 53 [2022-07-19 14:38:50,476 INFO L226 Difference]: Without dead ends: 44 [2022-07-19 14:38:50,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:38:50,477 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:38:50,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 64 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:38:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-19 14:38:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-07-19 14:38:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-19 14:38:50,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-07-19 14:38:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:50,481 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-19 14:38:50,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-19 14:38:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:38:50,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:50,482 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:50,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:38:50,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:38:50,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-07-19 14:38:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:38:50,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310137100] [2022-07-19 14:38:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:50,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:38:50,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:38:50,706 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:38:50,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 14:38:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:50,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:38:50,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:50,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:38:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:50,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:38:50,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310137100] [2022-07-19 14:38:50,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310137100] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:38:50,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:38:50,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-19 14:38:50,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107149268] [2022-07-19 14:38:50,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:38:50,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:38:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:38:50,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:38:50,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:38:50,962 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:38:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:51,039 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-07-19 14:38:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:38:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-07-19 14:38:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:51,043 INFO L225 Difference]: With dead ends: 66 [2022-07-19 14:38:51,043 INFO L226 Difference]: Without dead ends: 57 [2022-07-19 14:38:51,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:38:51,049 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 92 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:38:51,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 119 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:38:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-19 14:38:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2022-07-19 14:38:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-07-19 14:38:51,054 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2022-07-19 14:38:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:51,055 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-07-19 14:38:51,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:38:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-07-19 14:38:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 14:38:51,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:51,056 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, 1, 1, 1, 1, 1] [2022-07-19 14:38:51,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-19 14:38:51,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:38:51,266 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:51,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:51,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1120694760, now seen corresponding path program 2 times [2022-07-19 14:38:51,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:38:51,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688827727] [2022-07-19 14:38:51,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:38:51,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:38:51,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:38:51,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:38:51,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 14:38:51,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:38:51,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:38:51,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:38:51,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:51,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:38:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:51,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:38:51,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688827727] [2022-07-19 14:38:51,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688827727] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:38:51,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:38:51,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-19 14:38:51,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867318073] [2022-07-19 14:38:51,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:38:51,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:38:51,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:38:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:38:51,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:38:51,487 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:51,581 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-07-19 14:38:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:38:51,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-07-19 14:38:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:51,583 INFO L225 Difference]: With dead ends: 76 [2022-07-19 14:38:51,583 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 14:38:51,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:38:51,584 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:38:51,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 193 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:38:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 14:38:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 38. [2022-07-19 14:38:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:38:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-07-19 14:38:51,589 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 40 [2022-07-19 14:38:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:51,589 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-07-19 14:38:51,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-07-19 14:38:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 14:38:51,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:51,590 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, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:51,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-19 14:38:51,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:38:51,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2115896417, now seen corresponding path program 1 times [2022-07-19 14:38:51,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:38:51,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001314266] [2022-07-19 14:38:51,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:51,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:38:51,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:38:51,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:38:51,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 14:38:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:51,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-19 14:38:52,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:52,026 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:38:52,131 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:38:52,132 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 12 treesize of output 12 [2022-07-19 14:38:52,180 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:38:52,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:38:52,279 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-19 14:38:52,280 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 2 case distinctions, treesize of input 52 treesize of output 29 [2022-07-19 14:38:52,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 14:38:52,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:38:52,451 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-19 14:38:52,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 34 [2022-07-19 14:38:52,585 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:38:52,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 14 [2022-07-19 14:38:52,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 14:38:52,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:38:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:38:52,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:38:52,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2022-07-19 14:38:52,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) is different from false [2022-07-19 14:38:53,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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|) v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2022-07-19 14:38:53,040 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:38:53,040 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 36 treesize of output 37 [2022-07-19 14:38:53,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:38:53,064 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 64 treesize of output 67 [2022-07-19 14:38:53,080 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 25 treesize of output 21 [2022-07-19 14:38:54,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2022-07-19 14:38:54,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-19 14:38:54,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_338))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-19 14:38:54,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:38:54,885 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 38 treesize of output 31 [2022-07-19 14:38:54,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:38:54,910 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 295 treesize of output 285 [2022-07-19 14:38:54,921 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 294 treesize of output 278 [2022-07-19 14:38:54,981 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 6 treesize of output 4 [2022-07-19 14:38:54,986 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 50 treesize of output 46 [2022-07-19 14:38:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-19 14:38:55,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:38:55,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001314266] [2022-07-19 14:38:55,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001314266] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:38:55,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:38:55,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 41 [2022-07-19 14:38:55,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504952295] [2022-07-19 14:38:55,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:38:55,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-19 14:38:55,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:38:55,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-19 14:38:55,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1108, Unknown=6, NotChecked=426, Total=1640 [2022-07-19 14:38:55,418 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:38:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:58,888 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-07-19 14:38:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 14:38:58,889 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-07-19 14:38:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:58,890 INFO L225 Difference]: With dead ends: 75 [2022-07-19 14:38:58,890 INFO L226 Difference]: Without dead ends: 73 [2022-07-19 14:38:58,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=168, Invalid=1830, Unknown=6, NotChecked=546, Total=2550 [2022-07-19 14:38:58,892 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 14:38:58,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 625 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 398 Invalid, 0 Unknown, 321 Unchecked, 0.8s Time] [2022-07-19 14:38:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-19 14:38:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-07-19 14:38:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:38:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-07-19 14:38:58,905 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 41 [2022-07-19 14:38:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:58,906 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2022-07-19 14:38:58,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:38:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-07-19 14:38:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 14:38:58,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:58,911 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:58,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:38:59,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:38:59,114 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:59,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1219933381, now seen corresponding path program 1 times [2022-07-19 14:38:59,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:38:59,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532083786] [2022-07-19 14:38:59,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:38:59,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:38:59,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:38:59,116 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:38:59,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 14:38:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:38:59,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:38:59,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:38:59,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:38:59,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:38:59,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532083786] [2022-07-19 14:38:59,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532083786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:38:59,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:38:59,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:38:59,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100333687] [2022-07-19 14:38:59,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:38:59,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:38:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:38:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:38:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:38:59,244 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:59,271 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2022-07-19 14:38:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:38:59,271 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-07-19 14:38:59,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:59,272 INFO L225 Difference]: With dead ends: 80 [2022-07-19 14:38:59,272 INFO L226 Difference]: Without dead ends: 72 [2022-07-19 14:38:59,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:38:59,273 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 91 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:38:59,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 91 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:38:59,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-19 14:38:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-07-19 14:38:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:38:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-07-19 14:38:59,280 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 42 [2022-07-19 14:38:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:59,280 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-07-19 14:38:59,280 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-07-19 14:38:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 14:38:59,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:59,281 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:59,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:38:59,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:38:59,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:38:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:38:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash -628992200, now seen corresponding path program 2 times [2022-07-19 14:38:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:38:59,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549950492] [2022-07-19 14:38:59,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:38:59,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:38:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:38:59,504 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:38:59,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 14:38:59,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:38:59,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:38:59,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:38:59,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:38:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:59,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:38:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:38:59,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:38:59,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549950492] [2022-07-19 14:38:59,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549950492] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:38:59,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:38:59,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-19 14:38:59,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884813416] [2022-07-19 14:38:59,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:38:59,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:38:59,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:38:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:38:59,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:38:59,745 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:38:59,844 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2022-07-19 14:38:59,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:38:59,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-07-19 14:38:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:38:59,846 INFO L225 Difference]: With dead ends: 132 [2022-07-19 14:38:59,846 INFO L226 Difference]: Without dead ends: 110 [2022-07-19 14:38:59,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-07-19 14:38:59,847 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 197 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:38:59,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 179 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:38:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-19 14:38:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 67. [2022-07-19 14:38:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:38:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-07-19 14:38:59,857 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 42 [2022-07-19 14:38:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:38:59,857 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-07-19 14:38:59,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:38:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-07-19 14:38:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 14:38:59,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:38:59,858 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, 1, 1, 1, 1, 1, 1] [2022-07-19 14:38:59,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:39:00,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:39:00,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:39:00,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:39:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1999508780, now seen corresponding path program 1 times [2022-07-19 14:39:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:39:00,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322995498] [2022-07-19 14:39:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:39:00,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:39:00,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:39:00,078 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:39:00,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 14:39:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:39:00,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:39:00,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:39:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:39:00,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:39:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:39:00,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:39:00,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322995498] [2022-07-19 14:39:00,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322995498] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:39:00,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:39:00,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-19 14:39:00,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363674433] [2022-07-19 14:39:00,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:39:00,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:39:00,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:39:00,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:39:00,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:39:00,290 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:39:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:39:00,449 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-07-19 14:39:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:39:00,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-07-19 14:39:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:39:00,450 INFO L225 Difference]: With dead ends: 97 [2022-07-19 14:39:00,450 INFO L226 Difference]: Without dead ends: 89 [2022-07-19 14:39:00,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:39:00,451 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:39:00,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 185 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:39:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-19 14:39:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2022-07-19 14:39:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 63 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:39:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-07-19 14:39:00,458 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 47 [2022-07-19 14:39:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:39:00,459 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-07-19 14:39:00,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:39:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-07-19 14:39:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 14:39:00,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:39:00,459 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:39:00,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-19 14:39:00,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:39:00,669 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:39:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:39:00,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1222144142, now seen corresponding path program 3 times [2022-07-19 14:39:00,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:39:00,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40503534] [2022-07-19 14:39:00,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 14:39:00,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:39:00,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:39:00,671 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:39:00,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 14:39:00,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 14:39:00,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:39:00,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 14:39:00,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:39:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 14:39:00,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:39:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:39:01,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:39:01,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40503534] [2022-07-19 14:39:01,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40503534] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:39:01,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:39:01,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-07-19 14:39:01,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894428577] [2022-07-19 14:39:01,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:39:01,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:39:01,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:39:01,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:39:01,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:39:01,158 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:39:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:39:01,237 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2022-07-19 14:39:01,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:39:01,237 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-07-19 14:39:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:39:01,238 INFO L225 Difference]: With dead ends: 91 [2022-07-19 14:39:01,238 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 14:39:01,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:39:01,239 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:39:01,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 181 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:39:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 14:39:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-07-19 14:39:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.09375) internal successors, (70), 64 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:39:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-07-19 14:39:01,245 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 47 [2022-07-19 14:39:01,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:39:01,246 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-07-19 14:39:01,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:39:01,246 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-07-19 14:39:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 14:39:01,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:39:01,247 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:39:01,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:39:01,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:39:01,457 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:39:01,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:39:01,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1906883930, now seen corresponding path program 1 times [2022-07-19 14:39:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:39:01,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58418228] [2022-07-19 14:39:01,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:39:01,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:39:01,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:39:01,459 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:39:01,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 14:39:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:39:01,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-19 14:39:01,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:39:01,737 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:39:01,868 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:39:01,868 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 12 treesize of output 12 [2022-07-19 14:39:01,907 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:39:01,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:39:01,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:39:01,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:39:02,102 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-19 14:39:02,103 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 2 case distinctions, treesize of input 95 treesize of output 56 [2022-07-19 14:39:02,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2022-07-19 14:39:02,433 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 15 treesize of output 11 [2022-07-19 14:39:02,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:39:02,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-19 14:39:02,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:39:02,460 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-19 14:39:02,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-07-19 14:39:02,907 INFO L356 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2022-07-19 14:39:02,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 78 [2022-07-19 14:39:02,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:39:02,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:39:02,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2022-07-19 14:39:02,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:39:02,921 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 47 treesize of output 36 [2022-07-19 14:39:02,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:39:03,383 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 23 [2022-07-19 14:39:03,387 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 34 treesize of output 22 [2022-07-19 14:39:03,453 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:39:03,453 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 37 treesize of output 21 [2022-07-19 14:39:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:39:03,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:39:03,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2022-07-19 14:39:03,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2022-07-19 14:39:03,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2022-07-19 14:39:03,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)))))) is different from false [2022-07-19 14:39:03,997 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 656 treesize of output 588 [2022-07-19 14:39:04,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse5 v_ArrVal_741)))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse5 v_ArrVal_736))) (.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse9 (select (select (store .cse12 .cse10 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse6 (bvadd (_ bv8 32) (select (select (store .cse11 .cse10 v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (let ((.cse7 (= .cse6 (bvadd (_ bv8 32) (select (select .cse11 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (.cse0 (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32))) (.cse8 (= .cse10 .cse9))) (let ((.cse3 (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| .cse9)) (.cse2 (and .cse7 (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0) .cse8)) (.cse1 (or (not .cse7) (not .cse8))) (.cse4 (= .cse5 .cse6))) (or (and (or (and (= v_arrayElimCell_39 .cse0) .cse1) .cse2) (or (not .cse3) (not .cse4))) (and .cse3 (or .cse2 (and (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| .cse0) .cse1)) .cse4))))))))) is different from false [2022-07-19 14:39:05,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse5 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse6 .cse4 v_ArrVal_736)) .cse1 v_ArrVal_745) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse7 .cse4 v_ArrVal_741)) .cse1 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (= (bvadd (_ bv8 32) (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|)) .cse5)) (.cse2 (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) (or (and (= .cse0 .cse1) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse2) .cse3) (and (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (not .cse3) (= .cse4 .cse5) (= .cse2 (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|))))))))) is different from false [2022-07-19 14:39:05,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse1 .cse2 v_ArrVal_741)) .cse0 v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (= (bvadd (select .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (_ bv8 32)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse3 .cse2 v_ArrVal_736)) .cse0 v_ArrVal_745) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (_ bv8 32)))))))) is different from false [2022-07-19 14:39:05,261 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_726) (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_741)) .cse2 v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2))))) (forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= (bvadd (_ bv8 32) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store .cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_730) (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)) v_ArrVal_736)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_745) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (bvadd (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (_ bv8 32))))))) is different from false [2022-07-19 14:39:05,295 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (= (bvadd (_ bv8 32) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_730) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_736)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_745) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (bvadd (_ bv8 32) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741)) .cse4 v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse4)))))) is different from false [2022-07-19 14:39:05,353 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_736 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_723))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (= (bvadd (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_730) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_736)) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_745) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_726 (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_722))) (store .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_726) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_741)) .cse4 v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-07-19 14:39:05,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:39:05,389 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 157 treesize of output 118 [2022-07-19 14:39:05,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:39:05,417 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 1206 treesize of output 1198 [2022-07-19 14:39:05,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:39:05,439 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 680 treesize of output 496 [2022-07-19 14:39:05,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:39:05,462 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 1888 treesize of output 1798 [2022-07-19 14:39:05,475 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 1928 treesize of output 1832 [2022-07-19 14:39:05,543 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 1736 treesize of output 1712 [2022-07-19 14:39:05,557 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 1730 treesize of output 1720 [2022-07-19 14:39:06,441 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 6 treesize of output 4 [2022-07-19 14:39:06,444 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 65 treesize of output 59 [2022-07-19 14:39:06,457 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 6 treesize of output 4 [2022-07-19 14:39:06,466 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:39:06,466 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 1 [2022-07-19 14:39:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-19 14:39:06,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:39:06,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58418228] [2022-07-19 14:39:06,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58418228] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:39:06,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:39:06,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2022-07-19 14:39:06,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783896297] [2022-07-19 14:39:06,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:39:06,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-19 14:39:06,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:39:06,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-19 14:39:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1695, Unknown=10, NotChecked=910, Total=2756 [2022-07-19 14:39:06,894 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 47 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 14:39:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:39:11,526 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2022-07-19 14:39:11,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-19 14:39:11,526 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 47 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2022-07-19 14:39:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:39:11,527 INFO L225 Difference]: With dead ends: 79 [2022-07-19 14:39:11,527 INFO L226 Difference]: Without dead ends: 74 [2022-07-19 14:39:11,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 10 IntricatePredicates, 4 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=249, Invalid=2973, Unknown=10, NotChecked=1190, Total=4422 [2022-07-19 14:39:11,529 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 620 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 14:39:11,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 625 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 495 Invalid, 0 Unknown, 620 Unchecked, 0.6s Time] [2022-07-19 14:39:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-19 14:39:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2022-07-19 14:39:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:39:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-07-19 14:39:11,537 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 48 [2022-07-19 14:39:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:39:11,537 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-07-19 14:39:11,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 47 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 14:39:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-07-19 14:39:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 14:39:11,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:39:11,538 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:39:11,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-19 14:39:11,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:39:11,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:39:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:39:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash -964486420, now seen corresponding path program 2 times [2022-07-19 14:39:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:39:11,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908982234] [2022-07-19 14:39:11,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:39:11,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:39:11,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:39:11,751 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:39:11,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-19 14:39:11,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:39:11,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:39:11,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:39:11,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:39:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:39:11,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:39:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:39:11,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:39:11,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908982234] [2022-07-19 14:39:11,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908982234] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:39:11,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:39:11,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-19 14:39:11,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743371634] [2022-07-19 14:39:11,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:39:11,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:39:11,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:39:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:39:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:39:11,996 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:39:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:39:12,060 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-07-19 14:39:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:39:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-19 14:39:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:39:12,061 INFO L225 Difference]: With dead ends: 81 [2022-07-19 14:39:12,061 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 14:39:12,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-19 14:39:12,062 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:39:12,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 160 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:39:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 14:39:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-07-19 14:39:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:39:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-07-19 14:39:12,069 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 49 [2022-07-19 14:39:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:39:12,069 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-07-19 14:39:12,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:39:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-07-19 14:39:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 14:39:12,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:39:12,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1] [2022-07-19 14:39:12,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-19 14:39:12,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:39:12,280 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:39:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:39:12,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1687625933, now seen corresponding path program 4 times [2022-07-19 14:39:12,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:39:12,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536121022] [2022-07-19 14:39:12,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 14:39:12,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:39:12,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:39:12,283 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:39:12,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-19 14:39:12,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 14:39:12,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:39:12,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:39:12,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:39:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 14:39:12,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:39:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 14:39:12,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:39:12,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536121022] [2022-07-19 14:39:12,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536121022] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:39:12,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:39:12,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 14:39:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514739428] [2022-07-19 14:39:12,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:39:12,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:39:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:39:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:39:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:39:12,484 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 14:39:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:39:12,493 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-07-19 14:39:12,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:39:12,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-07-19 14:39:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:39:12,494 INFO L225 Difference]: With dead ends: 54 [2022-07-19 14:39:12,494 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 14:39:12,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:39:12,498 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:39:12,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:39:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 14:39:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 14:39:12,499 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:39:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 14:39:12,500 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2022-07-19 14:39:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:39:12,500 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 14:39:12,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 14:39:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 14:39:12,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 14:39:12,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:39:12,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-19 14:39:12,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:39:12,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 14:39:19,635 INFO L895 garLoopResultBuilder]: At program point L638(lines 626 645) the Hoare annotation is: false [2022-07-19 14:39:19,635 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))) [2022-07-19 14:39:19,635 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-07-19 14:39:19,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 14:39:19,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 14:39:19,636 INFO L899 garLoopResultBuilder]: For program point L631-2(lines 631 634) no Hoare annotation was computed. [2022-07-19 14:39:19,636 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse11 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) (let ((.cse4 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse0 (bvadd .cse11 (_ bv1 32))) (.cse6 (= |ULTIMATE.start_main_~len~0#1| .cse11)) (.cse8 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (let ((.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)))) (and (= (select (select |#memory_$Pointer$.offset| .cse10) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| .cse10) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))))) (.cse3 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse9 (not (= (select .cse1 (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|))) (.cse5 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse7 (= (select .cse2 (_ bv0 32)) (_ bv0 32)))) (or (and (= .cse0 (select (select |#memory_int| (select .cse1 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select .cse2 |ULTIMATE.start_main_~s~0#1.offset|)))) .cse3 .cse4 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) .cse5 .cse6 .cse7) (and .cse8 .cse3 .cse4 .cse9 (= .cse0 (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) .cse5 .cse6 .cse7) (and .cse8 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse3 .cse9 .cse5 .cse7)))) [2022-07-19 14:39:19,636 INFO L899 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2022-07-19 14:39:19,636 INFO L895 garLoopResultBuilder]: At program point L599(lines 585 600) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) [2022-07-19 14:39:19,636 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2022-07-19 14:39:19,636 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2022-07-19 14:39:19,636 INFO L895 garLoopResultBuilder]: At program point L617(lines 612 618) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (.cse1 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_dll_circular_get_data_at_#res#1| (_ bv3 32)) (not (bvsgt |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) .cse1) (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|))) (and .cse0 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32)) (= (bvadd .cse2 (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select .cse3 |ULTIMATE.start_main_~s~0#1.offset|)))) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= .cse2 (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32)) .cse1 (= |ULTIMATE.start_main_~len~0#1| .cse2) (= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32)))) (= (select .cse3 (_ bv0 32)) (_ bv0 32)))))) [2022-07-19 14:39:19,637 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-07-19 14:39:19,637 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 14:39:19,637 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-07-19 14:39:19,637 INFO L899 garLoopResultBuilder]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2022-07-19 14:39:19,638 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (not (bvsgt |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32)))) (.cse2 (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) (.cse3 (= (bvadd .cse8 (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select .cse7 |ULTIMATE.start_main_~s~0#1.offset|))))) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse1 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| .cse8)) (.cse6 (= (select .cse7 (_ bv0 32)) (_ bv0 32)))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) .cse1 .cse2) (and (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse0 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32)) .cse3 .cse4 .cse1 .cse2 .cse5 (= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32)))) .cse6) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse3 .cse4 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32)) .cse1 .cse5 .cse6)))) [2022-07-19 14:39:19,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2022-07-19 14:39:19,638 INFO L899 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2022-07-19 14:39:19,639 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 625) no Hoare annotation was computed. [2022-07-19 14:39:19,639 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))) [2022-07-19 14:39:19,639 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-07-19 14:39:19,639 INFO L902 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-07-19 14:39:19,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 14:39:19,639 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse4 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse5 (not (= (select .cse9 (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|))) (.cse0 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (let ((.cse12 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)))) (and (= (select (select |#memory_$Pointer$.offset| .cse12) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| .cse12) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))))) (.cse2 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse6 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (.cse11 (bvslt |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (.cse7 (= (select .cse8 (_ bv0 32)) (_ bv0 32)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_dll_circular_update_at_~data#1| (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) .cse6 .cse7) (and .cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| (select .cse8 |ULTIMATE.start_main_~s~0#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| (select .cse9 |ULTIMATE.start_main_~s~0#1.offset|)) .cse3 .cse4 .cse5 .cse6 (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select (store |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_int| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_745) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))) (= |ULTIMATE.start_main_~len~0#1| .cse10) .cse11 .cse7) (and .cse0 .cse1 .cse2 .cse3 (= (_ bv1 32) |ULTIMATE.start_dll_circular_update_at_~index#1|) .cse6 (= (bvadd .cse10 (_ bv1 32)) |ULTIMATE.start_dll_circular_update_at_~data#1|) (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_349) |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) .cse11 .cse7)))) [2022-07-19 14:39:19,639 INFO L899 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2022-07-19 14:39:19,639 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-07-19 14:39:19,640 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-07-19 14:39:19,640 INFO L899 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2022-07-19 14:39:19,640 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse2 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) .cse0 (not .cse1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) (_ bv0 32)) .cse2 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32))) (and .cse1 (= (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1)) .cse0 .cse2 (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))))) [2022-07-19 14:39:19,641 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2022-07-19 14:39:19,641 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse14 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse5 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (let ((.cse7 (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|)) (.cse9 (let ((.cse18 (bvslt |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse5 .cse18) (and .cse14 .cse5 .cse18)))) (.cse10 (not (bvsgt |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32)))) (.cse0 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))) (.cse1 (= (bvadd .cse4 (_ bv1 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select .cse17 |ULTIMATE.start_main_~s~0#1.offset|))))) (.cse2 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32))) (.cse3 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse6 (= |ULTIMATE.start_main_~len~0#1| .cse4)) (.cse8 (= (select .cse17 (_ bv0 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32)) .cse5 .cse6 (= |ULTIMATE.start_main_~expected~0#1| (select .cse7 (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32)))) .cse8) (let ((.cse13 (select .cse7 (_ bv8 32)))) (let ((.cse11 (bvadd (_ bv1 32) .cse13)) (.cse12 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32)))) (and .cse9 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv1 32)) .cse10 .cse1 .cse2 (= |ULTIMATE.start_main_~expected~0#1| .cse11) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32))) (bvadd (_ bv8 32) .cse12)) .cse11) .cse3 (= .cse12 (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse6 (= (_ bv2 32) .cse13) .cse8))) (and .cse9 .cse14 .cse10 .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13| (_ BitVec 32))) (let ((.cse16 (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13|) (_ bv8 32)))) (let ((.cse15 (bvadd .cse16 (_ bv1 32)))) (and (= |ULTIMATE.start_main_~expected~0#1| .cse15) (= .cse15 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32)))) (= (_ bv2 32) .cse16))))) .cse6 .cse8)))) [2022-07-19 14:39:19,641 INFO L899 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2022-07-19 14:39:19,641 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-07-19 14:39:19,641 INFO L899 garLoopResultBuilder]: For program point L577-1(lines 577 579) no Hoare annotation was computed. [2022-07-19 14:39:19,641 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-07-19 14:39:19,641 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 575 584) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-07-19 14:39:19,641 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 575 584) no Hoare annotation was computed. [2022-07-19 14:39:19,642 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-07-19 14:39:19,644 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2022-07-19 14:39:19,646 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:39:19,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,702 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,702 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_743,QUANTIFIED] [2022-07-19 14:39:19,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_745,QUANTIFIED] [2022-07-19 14:39:19,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_349,QUANTIFIED] [2022-07-19 14:39:19,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,729 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,729 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,730 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,730 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,734 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_743,QUANTIFIED] [2022-07-19 14:39:19,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,734 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_745,QUANTIFIED] [2022-07-19 14:39:19,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_349,QUANTIFIED] [2022-07-19 14:39:19,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,754 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,754 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,766 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,766 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,766 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:39:19 BoogieIcfgContainer [2022-07-19 14:39:19,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:39:19,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:39:19,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:39:19,773 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:39:19,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:38:49" (3/4) ... [2022-07-19 14:39:19,776 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 14:39:19,780 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-07-19 14:39:19,785 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-07-19 14:39:19,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-19 14:39:19,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 14:39:19,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 14:39:19,803 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0bv32 == new_head && \result == 0bv32) && !(last == new_head)) && 0bv32 == #memory_$Pointer$[\result][0bv32]) && head == 0bv32) && !(last == head)) && 2bv32 == len) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: 0bv32 == #memory_$Pointer$[#memory_$Pointer$[\result][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] && #memory_$Pointer$[#memory_$Pointer$[\result][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == \result)) && !(#memory_$Pointer$[\result][0bv32] == \result)) && #memory_$Pointer$[new_head][new_head] == last) && #memory_$Pointer$[head][0bv32] == last [2022-07-19 14:39:19,803 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])] && s == 0bv32) && index == 0bv32) && i == 2bv32) && 2bv32 == len) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32) || ((((((((\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == 0bv32 && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == ~bvadd64(i, len)) && 2bv32 == len) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32)) || ((((((\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == 0bv32 && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s) && i == 0bv32) && s == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && #memory_$Pointer$[s][0bv32] == 0bv32) [2022-07-19 14:39:19,804 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~bvsgt32(index, 0bv32) && i == 2bv32) && 2bv32 == len) && ~bvsgt32(i, 0bv32)) || ((((((((((expected == \result && i == 1bv32) && !~bvsgt32(index, 0bv32)) && index == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && s == 0bv32) && 2bv32 == len) && ~bvsgt32(i, 0bv32)) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && expected == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32)) || ((((((i == 0bv32 && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && s == 0bv32) && index == 0bv32) && 2bv32 == len) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32) [2022-07-19 14:39:19,804 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((s == head && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == 0bv32 && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && i == 0bv32) && head == s) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && data == ~bvadd64(i, len)) && 2bv32 == len) && #memory_$Pointer$[s][0bv32] == 0bv32) || ((((((((((((\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == 0bv32 && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s) && i == 1bv32) && head == #memory_$Pointer$[s][s]) && head == #memory_$Pointer$[s][s]) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && (forall v_ArrVal_743 : [bv32]bv32, v_ArrVal_745 : [bv32]bv32 :: ~bvadd64(len, 1bv32) == unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][~bvadd64(8bv32, head) := data]][#memory_$Pointer$[head := v_ArrVal_743][s][s]][~bvadd64(8bv32, #memory_$Pointer$[head := v_ArrVal_745][s][s])])) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && ~bvslt32(i, len)) && #memory_$Pointer$[s][0bv32] == 0bv32)) || ((((((((((s == head && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == 0bv32 && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && head == s) && s == 0bv32) && 1bv32 == index) && 2bv32 == len) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == data) && ~bvsgt32(i, 0bv32)) && (forall v_ArrVal_349 : [bv32]bv32 :: len == unknown-#memory_int-unknown[#memory_$Pointer$[head][head] := v_ArrVal_349][s][~bvadd64(s, 8bv32)])) && ~bvslt32(i, len)) && #memory_$Pointer$[s][0bv32] == 0bv32) [2022-07-19 14:39:19,804 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((index == 0bv32 && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && head == 0bv32) && s == 0bv32) && unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)] == ~bvadd64(i, len)) && index == 0bv32) && 2bv32 == len) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && expected == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32) || (((((((((((((((i == 0bv32 && 2bv32 == len) && ~bvslt32(i, len)) || ((i == 1bv32 && 2bv32 == len) && ~bvslt32(i, len))) && index == 1bv32) && !~bvsgt32(index, 0bv32)) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && head == 0bv32) && expected == ~bvadd64(1bv32, unknown-#memory_int-unknown[head][8bv32])) && unknown-#memory_int-unknown[#memory_$Pointer$[head][0bv32]][~bvadd64(8bv32, #memory_$Pointer$[head][0bv32])] == ~bvadd64(1bv32, unknown-#memory_int-unknown[head][8bv32])) && s == 0bv32) && #memory_$Pointer$[head][0bv32] == 0bv32) && ~bvsgt32(i, 0bv32)) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && 2bv32 == unknown-#memory_int-unknown[head][8bv32]) && #memory_$Pointer$[s][0bv32] == 0bv32)) || ((((((((((((i == 0bv32 && 2bv32 == len) && ~bvslt32(i, len)) || ((i == 1bv32 && 2bv32 == len) && ~bvslt32(i, len))) && i == 1bv32) && !~bvsgt32(index, 0bv32)) && index == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && head == 0bv32) && s == 0bv32) && (\exists v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13 : bv32 :: (expected == ~bvadd64(unknown-#memory_int-unknown[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13][8bv32], 1bv32) && ~bvadd64(unknown-#memory_int-unknown[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13][8bv32], 1bv32) == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && 2bv32 == unknown-#memory_int-unknown[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13][8bv32])) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32) [2022-07-19 14:39:19,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((expected == \result && i == 1bv32) && \result == 3bv32) && !~bvsgt32(index, 0bv32)) && 2bv32 == len) || ((((((((((expected == \result && index == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && head == 0bv32) && s == 0bv32) && unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)] == ~bvadd64(i, len)) && index == 0bv32) && 2bv32 == len) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && expected == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32) [2022-07-19 14:39:19,820 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:39:19,820 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:39:19,821 INFO L158 Benchmark]: Toolchain (without parser) took 31423.59ms. Allocated memory was 67.1MB in the beginning and 245.4MB in the end (delta: 178.3MB). Free memory was 46.4MB in the beginning and 91.5MB in the end (delta: -45.1MB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. [2022-07-19 14:39:19,822 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 48.9MB in the beginning and 48.8MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:39:19,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.14ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 42.2MB in the end (delta: 3.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 14:39:19,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.58ms. Allocated memory is still 67.1MB. Free memory was 42.2MB in the beginning and 39.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:39:19,824 INFO L158 Benchmark]: Boogie Preprocessor took 51.58ms. Allocated memory is still 67.1MB. Free memory was 39.9MB in the beginning and 38.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:39:19,824 INFO L158 Benchmark]: RCFGBuilder took 403.16ms. Allocated memory is still 67.1MB. Free memory was 37.8MB in the beginning and 43.6MB in the end (delta: -5.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-07-19 14:39:19,825 INFO L158 Benchmark]: TraceAbstraction took 30455.04ms. Allocated memory was 67.1MB in the beginning and 245.4MB in the end (delta: 178.3MB). Free memory was 43.0MB in the beginning and 94.6MB in the end (delta: -51.6MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2022-07-19 14:39:19,825 INFO L158 Benchmark]: Witness Printer took 47.79ms. Allocated memory is still 245.4MB. Free memory was 94.6MB in the beginning and 91.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:39:19,828 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.15ms. Allocated memory is still 67.1MB. Free memory was 48.9MB in the beginning and 48.8MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.14ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 42.2MB in the end (delta: 3.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.58ms. Allocated memory is still 67.1MB. Free memory was 42.2MB in the beginning and 39.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.58ms. Allocated memory is still 67.1MB. Free memory was 39.9MB in the beginning and 38.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.16ms. Allocated memory is still 67.1MB. Free memory was 37.8MB in the beginning and 43.6MB in the end (delta: -5.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 30455.04ms. Allocated memory was 67.1MB in the beginning and 245.4MB in the end (delta: 178.3MB). Free memory was 43.0MB in the beginning and 94.6MB in the end (delta: -51.6MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. * Witness Printer took 47.79ms. Allocated memory is still 245.4MB. Free memory was 94.6MB in the beginning and 91.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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$.offset - 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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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$.offset - 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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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$.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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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$.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_743,QUANTIFIED] - 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_745,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$.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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_349,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 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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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$.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_743,QUANTIFIED] - 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_745,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$.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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_349,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 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 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 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 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 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 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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 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 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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 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[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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 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 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 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 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$.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$.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$.offset - 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 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_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,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$.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$.offset - 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 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_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 643]: 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 687 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 684 mSDsluCounter, 2567 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 941 IncrementalHoareTripleChecker+Unchecked, 2126 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1240 IncrementalHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 441 mSDtfsCounter, 1240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 751 SyntacticMatches, 13 SemanticMatches, 185 ConstructedPredicates, 16 IntricatePredicates, 6 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=11, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 147 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 38 NumberOfFragments, 1166 HoareAnnotationTreeSize, 18 FomulaSimplifications, 32863 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 14 FomulaSimplificationsInter, 16054 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 512 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 890 ConstructedInterpolants, 48 QuantifiedInterpolants, 6671 SizeOfPredicates, 112 NumberOfNonLiveVariables, 2788 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 269/386 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: 626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 585]: Loop Invariant [2022-07-19 14:39:19,852 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,853 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,853 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,854 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,855 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((0bv32 == new_head && \result == 0bv32) && !(last == new_head)) && 0bv32 == #memory_$Pointer$[\result][0bv32]) && head == 0bv32) && !(last == head)) && 2bv32 == len) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: 0bv32 == #memory_$Pointer$[#memory_$Pointer$[\result][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] && #memory_$Pointer$[#memory_$Pointer$[\result][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == \result)) && !(#memory_$Pointer$[\result][0bv32] == \result)) && #memory_$Pointer$[new_head][new_head] == last) && #memory_$Pointer$[head][0bv32] == last - InvariantResult [Line: 620]: Loop Invariant [2022-07-19 14:39:19,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,857 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,857 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,858 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,859 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,860 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,860 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_743,QUANTIFIED] [2022-07-19 14:39:19,860 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,860 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_745,QUANTIFIED] [2022-07-19 14:39:19,860 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,860 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,861 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,861 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,861 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_349,QUANTIFIED] [2022-07-19 14:39:19,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,863 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,863 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,865 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,866 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,869 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_743,QUANTIFIED] [2022-07-19 14:39:19,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,869 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_745,QUANTIFIED] [2022-07-19 14:39:19,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,870 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,870 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,871 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_349,QUANTIFIED] [2022-07-19 14:39:19,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((s == head && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == 0bv32 && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && i == 0bv32) && head == s) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && data == ~bvadd64(i, len)) && 2bv32 == len) && #memory_$Pointer$[s][0bv32] == 0bv32) || ((((((((((((\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == 0bv32 && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s) && i == 1bv32) && head == #memory_$Pointer$[s][s]) && head == #memory_$Pointer$[s][s]) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && (forall v_ArrVal_743 : [bv32]bv32, v_ArrVal_745 : [bv32]bv32 :: ~bvadd64(len, 1bv32) == unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][~bvadd64(8bv32, head) := data]][#memory_$Pointer$[head := v_ArrVal_743][s][s]][~bvadd64(8bv32, #memory_$Pointer$[head := v_ArrVal_745][s][s])])) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && ~bvslt32(i, len)) && #memory_$Pointer$[s][0bv32] == 0bv32)) || ((((((((((s == head && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == 0bv32 && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && head == s) && s == 0bv32) && 1bv32 == index) && 2bv32 == len) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == data) && ~bvsgt32(i, 0bv32)) && (forall v_ArrVal_349 : [bv32]bv32 :: len == unknown-#memory_int-unknown[#memory_$Pointer$[head][head] := v_ArrVal_349][s][~bvadd64(s, 8bv32)])) && ~bvslt32(i, len)) && #memory_$Pointer$[s][0bv32] == 0bv32) - InvariantResult [Line: 635]: Loop Invariant [2022-07-19 14:39:19,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((!~bvsgt32(index, 0bv32) && i == 2bv32) && 2bv32 == len) && ~bvsgt32(i, 0bv32)) || ((((((((((expected == \result && i == 1bv32) && !~bvsgt32(index, 0bv32)) && index == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && s == 0bv32) && 2bv32 == len) && ~bvsgt32(i, 0bv32)) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && expected == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32)) || ((((((i == 0bv32 && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && s == 0bv32) && index == 0bv32) && 2bv32 == len) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-07-19 14:39:19,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,876 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,876 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,877 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,878 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-19 14:39:19,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])] && s == 0bv32) && index == 0bv32) && i == 2bv32) && 2bv32 == len) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32) || ((((((((\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == 0bv32 && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == ~bvadd64(i, len)) && 2bv32 == len) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32)) || ((((((\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == 0bv32 && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s) && i == 0bv32) && s == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && #memory_$Pointer$[s][0bv32] == 0bv32) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 612]: Loop Invariant [2022-07-19 14:39:19,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((expected == \result && i == 1bv32) && \result == 3bv32) && !~bvsgt32(index, 0bv32)) && 2bv32 == len) || ((((((((((expected == \result && index == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && head == 0bv32) && s == 0bv32) && unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)] == ~bvadd64(i, len)) && index == 0bv32) && 2bv32 == len) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && expected == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32) - InvariantResult [Line: 588]: Loop Invariant [2022-07-19 14:39:19,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((0bv32 == new_head && 0bv32 == #memory_$Pointer$[new_head][new_head]) && !(last == new_head)) && head == 0bv32) && !(last == head)) && #memory_$Pointer$[head][0bv32] == 0bv32) && 2bv32 == len) && #memory_$Pointer$[new_head][new_head] == last) && #memory_$Pointer$[head][0bv32] == last) && len == 1bv32) || ((((last == head && ~bvadd64(1bv1, ~bvneg64(\valid[head])) == 0bv1) && head == 0bv32) && 2bv32 == len) && len == 2bv32) - InvariantResult [Line: 613]: Loop Invariant [2022-07-19 14:39:19,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,887 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,887 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,887 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 14:39:19,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 14:39:19,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,890 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13,QUANTIFIED] [2022-07-19 14:39:19,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((index == 0bv32 && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && head == 0bv32) && s == 0bv32) && unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)] == ~bvadd64(i, len)) && index == 0bv32) && 2bv32 == len) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && expected == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32) || (((((((((((((((i == 0bv32 && 2bv32 == len) && ~bvslt32(i, len)) || ((i == 1bv32 && 2bv32 == len) && ~bvslt32(i, len))) && index == 1bv32) && !~bvsgt32(index, 0bv32)) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && head == 0bv32) && expected == ~bvadd64(1bv32, unknown-#memory_int-unknown[head][8bv32])) && unknown-#memory_int-unknown[#memory_$Pointer$[head][0bv32]][~bvadd64(8bv32, #memory_$Pointer$[head][0bv32])] == ~bvadd64(1bv32, unknown-#memory_int-unknown[head][8bv32])) && s == 0bv32) && #memory_$Pointer$[head][0bv32] == 0bv32) && ~bvsgt32(i, 0bv32)) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && 2bv32 == unknown-#memory_int-unknown[head][8bv32]) && #memory_$Pointer$[s][0bv32] == 0bv32)) || ((((((((((((i == 0bv32 && 2bv32 == len) && ~bvslt32(i, len)) || ((i == 1bv32 && 2bv32 == len) && ~bvslt32(i, len))) && i == 1bv32) && !~bvsgt32(index, 0bv32)) && index == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)], 1bv32) == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])]) && head == 0bv32) && s == 0bv32) && (\exists v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13 : bv32 :: (expected == ~bvadd64(unknown-#memory_int-unknown[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13][8bv32], 1bv32) && ~bvadd64(unknown-#memory_int-unknown[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13][8bv32], 1bv32) == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && 2bv32 == unknown-#memory_int-unknown[v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_13][8bv32])) && len == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && #memory_$Pointer$[s][0bv32] == 0bv32) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-19 14:39:19,947 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