./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.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 --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 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:50:49,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:50:49,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:50:49,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:50:49,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:50:49,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:50:49,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:50:49,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:50:49,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:50:49,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:50:49,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:50:49,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:50:49,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:50:49,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:50:49,567 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:50:49,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:50:49,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:50:49,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:50:49,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:50:49,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:50:49,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:50:49,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:50:49,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:50:49,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:50:49,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:50:49,569 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:50:49,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:50:49,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:50:49,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:50:49,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:50:49,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:50:49,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:50:49,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:50:49,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:50:49,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:50:49,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:50:49,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:50:49,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:50:49,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:50:49,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:50:49,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:50:49,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:50:49,572 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2024-11-19 20:50:49,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:50:49,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:50:49,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:50:49,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:50:49,776 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:50:49,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2024-11-19 20:50:50,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:50:51,136 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:50:51,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2024-11-19 20:50:51,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67fc1caac/f4fd871862b442af82388a4a51f52c09/FLAG14af24554 [2024-11-19 20:50:51,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67fc1caac/f4fd871862b442af82388a4a51f52c09 [2024-11-19 20:50:51,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:50:51,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:50:51,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:50:51,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:50:51,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:50:51,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:51,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b7aabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51, skipping insertion in model container [2024-11-19 20:50:51,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:51,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:50:51,764 WARN L250 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/sll2c_remove_all_reverse.i[24151,24164] [2024-11-19 20:50:51,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:50:51,775 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:50:51,833 WARN L250 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/sll2c_remove_all_reverse.i[24151,24164] [2024-11-19 20:50:51,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:50:51,860 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:50:51,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51 WrapperNode [2024-11-19 20:50:51,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:50:51,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:50:51,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:50:51,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:50:51,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:51,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:51,897 INFO L138 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2024-11-19 20:50:51,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:50:51,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:50:51,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:50:51,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:50:51,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:51,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:51,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:51,992 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-11-19 20:50:51,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:51,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:52,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:52,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:52,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:52,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:52,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:50:52,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:50:52,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:50:52,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:50:52,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (1/1) ... [2024-11-19 20:50:52,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:50:52,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:52,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 20:50:52,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 20:50:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 20:50:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 20:50:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 20:50:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 20:50:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 20:50:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:50:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:50:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:50:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:50:52,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:50:52,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:50:52,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:50:52,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:50:52,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:50:52,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:50:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:50:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:50:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:50:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:50:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:50:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:50:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:50:52,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:50:52,184 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:50:52,186 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:50:52,319 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-19 20:50:52,320 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:50:52,329 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:50:52,329 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 20:50:52,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:50:52 BoogieIcfgContainer [2024-11-19 20:50:52,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:50:52,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:50:52,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:50:52,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:50:52,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:50:51" (1/3) ... [2024-11-19 20:50:52,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abe935a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:50:52, skipping insertion in model container [2024-11-19 20:50:52,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:51" (2/3) ... [2024-11-19 20:50:52,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abe935a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:50:52, skipping insertion in model container [2024-11-19 20:50:52,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:50:52" (3/3) ... [2024-11-19 20:50:52,336 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2024-11-19 20:50:52,349 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:50:52,349 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:50:52,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:50:52,392 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aaf6171, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:50:52,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:50:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 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) [2024-11-19 20:50:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 20:50:52,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:52,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:50:52,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:52,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 18959570, now seen corresponding path program 1 times [2024-11-19 20:50:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:52,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75115099] [2024-11-19 20:50:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:52,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:52,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:50:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:52,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75115099] [2024-11-19 20:50:52,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75115099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:50:52,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:50:52,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:50:52,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609312177] [2024-11-19 20:50:52,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:50:52,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:50:52,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:52,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:50:52,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:50:52,648 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 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 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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) [2024-11-19 20:50:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:52,686 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2024-11-19 20:50:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:50:52,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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 16 [2024-11-19 20:50:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:52,693 INFO L225 Difference]: With dead ends: 51 [2024-11-19 20:50:52,693 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 20:50:52,695 INFO L431 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 [2024-11-19 20:50:52,697 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 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 [2024-11-19 20:50:52,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:50:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 20:50:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 20:50:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2024-11-19 20:50:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-19 20:50:52,719 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 16 [2024-11-19 20:50:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:52,720 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-19 20:50:52,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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) [2024-11-19 20:50:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-19 20:50:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 20:50:52,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:52,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:50:52,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:50:52,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:52,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1012316651, now seen corresponding path program 1 times [2024-11-19 20:50:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:52,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726743496] [2024-11-19 20:50:52,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:52,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:52,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:50:52,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:52,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726743496] [2024-11-19 20:50:52,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726743496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:50:52,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:50:52,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:50:52,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936488450] [2024-11-19 20:50:52,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:50:52,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:50:52,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:52,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:50:52,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:50:52,850 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-11-19 20:50:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:52,886 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-11-19 20:50:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:50:52,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2024-11-19 20:50:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:52,888 INFO L225 Difference]: With dead ends: 47 [2024-11-19 20:50:52,888 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 20:50:52,889 INFO L431 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 [2024-11-19 20:50:52,890 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:52,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:50:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 20:50:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-19 20:50:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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) [2024-11-19 20:50:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-19 20:50:52,896 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 16 [2024-11-19 20:50:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:52,896 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-19 20:50:52,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-11-19 20:50:52,896 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-19 20:50:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 20:50:52,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:52,897 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:50:52,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:50:52,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:52,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:52,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1534086739, now seen corresponding path program 1 times [2024-11-19 20:50:52,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:52,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166735632] [2024-11-19 20:50:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:52,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:53,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:53,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:50:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:50:53,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:53,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166735632] [2024-11-19 20:50:53,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166735632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:53,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853985435] [2024-11-19 20:50:53,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:53,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:53,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:53,105 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) [2024-11-19 20:50:53,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 20:50:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:53,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 20:50:53,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 20:50:53,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:50:53,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853985435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:50:53,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 20:50:53,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 20:50:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991850756] [2024-11-19 20:50:53,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:50:53,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:50:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:53,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:50:53,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:50:53,282 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-19 20:50:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:53,308 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-19 20:50:53,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:50:53,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 24 [2024-11-19 20:50:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:53,310 INFO L225 Difference]: With dead ends: 43 [2024-11-19 20:50:53,310 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 20:50:53,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:50:53,311 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 26 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:53,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:50:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 20:50:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2024-11-19 20:50:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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) [2024-11-19 20:50:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-19 20:50:53,318 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2024-11-19 20:50:53,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:53,319 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-19 20:50:53,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-19 20:50:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-19 20:50:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 20:50:53,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:53,320 INFO L215 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] [2024-11-19 20:50:53,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 20:50:53,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:53,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:53,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash -336289866, now seen corresponding path program 1 times [2024-11-19 20:50:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:53,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944900875] [2024-11-19 20:50:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:53,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:53,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:53,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:50:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:50:53,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:53,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944900875] [2024-11-19 20:50:53,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944900875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:53,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884456116] [2024-11-19 20:50:53,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:53,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:53,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:53,668 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) [2024-11-19 20:50:53,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:50:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:53,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 20:50:53,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 20:50:53,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 20:50:53,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884456116] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:50:53,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:50:53,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-11-19 20:50:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458722671] [2024-11-19 20:50:53,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:50:53,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 20:50:53,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 20:50:53,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 20:50:53,866 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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) [2024-11-19 20:50:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:53,937 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-11-19 20:50:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 20:50:53,938 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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 31 [2024-11-19 20:50:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:53,938 INFO L225 Difference]: With dead ends: 55 [2024-11-19 20:50:53,939 INFO L226 Difference]: Without dead ends: 51 [2024-11-19 20:50:53,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:50:53,940 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 61 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:53,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 135 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:50:53,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-19 20:50:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2024-11-19 20:50:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 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) [2024-11-19 20:50:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-19 20:50:53,948 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 31 [2024-11-19 20:50:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:53,948 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-19 20:50:53,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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) [2024-11-19 20:50:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-19 20:50:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 20:50:53,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:53,951 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 20:50:53,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 20:50:54,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 20:50:54,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:54,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1253213581, now seen corresponding path program 2 times [2024-11-19 20:50:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:54,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204309386] [2024-11-19 20:50:54,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:54,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:50:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:50:54,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204309386] [2024-11-19 20:50:54,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204309386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:50:54,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:50:54,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 20:50:54,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50712492] [2024-11-19 20:50:54,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:50:54,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:50:54,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:54,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:50:54,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:50:54,403 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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) [2024-11-19 20:50:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:54,468 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-11-19 20:50:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:50:54,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 38 [2024-11-19 20:50:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:54,470 INFO L225 Difference]: With dead ends: 57 [2024-11-19 20:50:54,470 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 20:50:54,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:50:54,471 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:54,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 118 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:50:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 20:50:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 20:50:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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) [2024-11-19 20:50:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-19 20:50:54,478 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 38 [2024-11-19 20:50:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:54,479 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-19 20:50:54,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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) [2024-11-19 20:50:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-19 20:50:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 20:50:54,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:54,480 INFO L215 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] [2024-11-19 20:50:54,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 20:50:54,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:54,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash -180232099, now seen corresponding path program 1 times [2024-11-19 20:50:54,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:54,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225461023] [2024-11-19 20:50:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:54,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:54,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:54,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:50:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 20:50:54,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:54,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225461023] [2024-11-19 20:50:54,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225461023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:50:54,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:50:54,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 20:50:54,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741799579] [2024-11-19 20:50:54,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:50:54,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:50:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:54,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:50:54,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:50:54,596 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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) [2024-11-19 20:50:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:54,642 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-19 20:50:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:50:54,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 44 [2024-11-19 20:50:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:54,643 INFO L225 Difference]: With dead ends: 68 [2024-11-19 20:50:54,643 INFO L226 Difference]: Without dead ends: 44 [2024-11-19 20:50:54,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:50:54,644 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:54,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:50:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-19 20:50:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-19 20:50:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 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) [2024-11-19 20:50:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-19 20:50:54,650 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 44 [2024-11-19 20:50:54,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:54,650 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-19 20:50:54,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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) [2024-11-19 20:50:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-19 20:50:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 20:50:54,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:54,651 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-19 20:50:54,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 20:50:54,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:54,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash 246982931, now seen corresponding path program 1 times [2024-11-19 20:50:54,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:54,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877419601] [2024-11-19 20:50:54,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:55,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:50:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 20:50:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:55,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877419601] [2024-11-19 20:50:55,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877419601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:55,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963028611] [2024-11-19 20:50:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:55,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:55,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:55,010 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) [2024-11-19 20:50:55,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:50:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:55,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-19 20:50:55,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:55,584 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-19 20:50:55,585 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2024-11-19 20:50:55,594 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-19 20:50:55,943 INFO L378 Elim1Store]: Elim1 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 58 treesize of output 34 [2024-11-19 20:50:56,009 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 20:50:56,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2024-11-19 20:50:56,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:50:56,022 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 15 [2024-11-19 20:50:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 20:50:56,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:56,298 INFO L378 Elim1Store]: Elim1 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 64 treesize of output 52 [2024-11-19 20:50:56,422 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 20:50:56,422 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 31 [2024-11-19 20:50:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:50:56,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963028611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:50:56,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:50:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 13] total 35 [2024-11-19 20:50:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963323782] [2024-11-19 20:50:56,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:50:56,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 20:50:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:56,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 20:50:56,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 20:50:56,447 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 32 states have internal predecessors, (88), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 20:50:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:56,825 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2024-11-19 20:50:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 20:50:56,826 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 32 states have internal predecessors, (88), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-11-19 20:50:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:56,826 INFO L225 Difference]: With dead ends: 75 [2024-11-19 20:50:56,826 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 20:50:56,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=1208, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 20:50:56,827 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:56,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 251 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:50:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 20:50:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-11-19 20:50:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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) [2024-11-19 20:50:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-11-19 20:50:56,839 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 48 [2024-11-19 20:50:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:56,839 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-11-19 20:50:56,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 32 states have internal predecessors, (88), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 20:50:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-11-19 20:50:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 20:50:56,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:56,842 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 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] [2024-11-19 20:50:56,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 20:50:57,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:57,047 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:57,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash 531611278, now seen corresponding path program 1 times [2024-11-19 20:50:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:57,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790836991] [2024-11-19 20:50:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:57,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:57,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:50:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 20:50:57,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790836991] [2024-11-19 20:50:57,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790836991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750650020] [2024-11-19 20:50:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:57,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:57,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:57,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:50:57,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:50:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:57,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 20:50:57,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:57,522 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 26 [2024-11-19 20:50:57,525 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 18 [2024-11-19 20:50:57,533 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:50:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 20:50:57,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:57,584 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2024-11-19 20:50:57,584 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 19 [2024-11-19 20:50:57,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 20:50:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 20:50:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750650020] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:50:57,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:50:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 9 [2024-11-19 20:50:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832755334] [2024-11-19 20:50:57,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:50:57,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 20:50:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:57,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 20:50:57,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:50:57,603 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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) [2024-11-19 20:50:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:57,682 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2024-11-19 20:50:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 20:50:57,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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 50 [2024-11-19 20:50:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:57,683 INFO L225 Difference]: With dead ends: 92 [2024-11-19 20:50:57,683 INFO L226 Difference]: Without dead ends: 60 [2024-11-19 20:50:57,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:50:57,684 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:57,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 112 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:50:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-19 20:50:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-19 20:50:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 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) [2024-11-19 20:50:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2024-11-19 20:50:57,690 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 50 [2024-11-19 20:50:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:57,691 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-19 20:50:57,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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) [2024-11-19 20:50:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2024-11-19 20:50:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 20:50:57,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:57,692 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 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] [2024-11-19 20:50:57,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 20:50:57,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:57,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:57,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1766412247, now seen corresponding path program 2 times [2024-11-19 20:50:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:57,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111546453] [2024-11-19 20:50:57,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:57,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:58,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:50:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:50:58,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:58,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111546453] [2024-11-19 20:50:58,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111546453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:58,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468234260] [2024-11-19 20:50:58,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:50:58,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:58,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:58,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:50:58,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:50:59,101 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:50:59,101 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:50:59,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-19 20:50:59,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:59,130 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:50:59,345 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 20:50:59,345 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:50:59,377 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:50:59,383 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:50:59,450 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 20:50:59,451 INFO L378 Elim1Store]: Elim1 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 47 treesize of output 33 [2024-11-19 20:50:59,456 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 22 [2024-11-19 20:50:59,739 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:50:59,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:50:59,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:50:59,747 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-11-19 20:50:59,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 113 treesize of output 54 [2024-11-19 20:50:59,934 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 20:50:59,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:59,965 INFO L378 Elim1Store]: Elim1 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 12 treesize of output 8 [2024-11-19 20:51:00,152 INFO L378 Elim1Store]: Elim1 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 80 treesize of output 56 [2024-11-19 20:51:00,154 INFO L378 Elim1Store]: Elim1 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 60 treesize of output 36 [2024-11-19 20:51:00,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:00,242 INFO L378 Elim1Store]: Elim1 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 840 treesize of output 720 [2024-11-19 20:51:00,335 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 20:51:00,335 INFO L378 Elim1Store]: Elim1 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 421 treesize of output 1 [2024-11-19 20:51:00,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468234260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:00,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:00,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2024-11-19 20:51:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486924471] [2024-11-19 20:51:00,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:00,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 20:51:00,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:00,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 20:51:00,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2007, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 20:51:00,520 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 31 states have internal predecessors, (69), 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) [2024-11-19 20:51:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:01,089 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2024-11-19 20:51:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 20:51:01,089 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 31 states have internal predecessors, (69), 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 52 [2024-11-19 20:51:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:01,091 INFO L225 Difference]: With dead ends: 122 [2024-11-19 20:51:01,091 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 20:51:01,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=2625, Unknown=0, NotChecked=0, Total=2862 [2024-11-19 20:51:01,092 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 86 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:01,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 309 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:51:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 20:51:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-19 20:51:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 73 states have internal predecessors, (83), 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) [2024-11-19 20:51:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-11-19 20:51:01,102 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 52 [2024-11-19 20:51:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:01,103 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-11-19 20:51:01,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 31 states have internal predecessors, (69), 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) [2024-11-19 20:51:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-11-19 20:51:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 20:51:01,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:01,104 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 4, 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] [2024-11-19 20:51:01,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 20:51:01,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:01,304 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:01,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1895236671, now seen corresponding path program 3 times [2024-11-19 20:51:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:01,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91229000] [2024-11-19 20:51:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:01,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:51:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:01,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:51:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-19 20:51:01,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:01,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91229000] [2024-11-19 20:51:01,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91229000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:01,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380773474] [2024-11-19 20:51:01,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 20:51:01,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:01,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:01,927 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:51:01,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 20:51:02,240 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 20:51:02,240 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:51:02,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-19 20:51:02,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:02,265 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:51:02,439 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 20:51:02,439 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:51:02,473 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:51:02,478 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:51:02,521 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 20:51:02,522 INFO L378 Elim1Store]: Elim1 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 47 treesize of output 33 [2024-11-19 20:51:02,527 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 22 [2024-11-19 20:51:02,762 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-11-19 20:51:02,762 INFO L378 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 35 [2024-11-19 20:51:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 20:51:02,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:02,909 INFO L378 Elim1Store]: Elim1 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 80 treesize of output 56 [2024-11-19 20:51:02,911 INFO L378 Elim1Store]: Elim1 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 60 treesize of output 36 [2024-11-19 20:51:02,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:02,970 INFO L378 Elim1Store]: Elim1 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 840 treesize of output 720 [2024-11-19 20:51:03,049 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 20:51:03,049 INFO L378 Elim1Store]: Elim1 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 421 treesize of output 1 [2024-11-19 20:51:03,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380773474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:03,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:03,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2024-11-19 20:51:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767540338] [2024-11-19 20:51:03,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:03,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 20:51:03,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 20:51:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 20:51:03,210 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 25 states have internal predecessors, (57), 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) [2024-11-19 20:51:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:03,575 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2024-11-19 20:51:03,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 20:51:03,576 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 25 states have internal predecessors, (57), 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 56 [2024-11-19 20:51:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:03,576 INFO L225 Difference]: With dead ends: 115 [2024-11-19 20:51:03,576 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 20:51:03,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 20:51:03,577 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:03,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 407 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 20:51:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 20:51:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-11-19 20:51:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 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) [2024-11-19 20:51:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-11-19 20:51:03,583 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 56 [2024-11-19 20:51:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:03,583 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-11-19 20:51:03,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 25 states have internal predecessors, (57), 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) [2024-11-19 20:51:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-11-19 20:51:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 20:51:03,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:03,584 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 20:51:03,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 20:51:03,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:03,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:03,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1302933441, now seen corresponding path program 4 times [2024-11-19 20:51:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:03,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817198779] [2024-11-19 20:51:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:03,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:51:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:03,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:51:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:03,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 20:51:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:51:03,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:03,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817198779] [2024-11-19 20:51:03,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817198779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:03,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951999592] [2024-11-19 20:51:03,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 20:51:03,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:03,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:03,866 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:51:03,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 20:51:04,003 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 20:51:04,004 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:51:04,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 20:51:04,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-19 20:51:04,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:51:04,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951999592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:51:04,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 20:51:04,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-19 20:51:04,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130542011] [2024-11-19 20:51:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:51:04,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:51:04,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:04,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:51:04,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:51:04,025 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:51:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:04,034 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-11-19 20:51:04,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:51:04,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-11-19 20:51:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:04,034 INFO L225 Difference]: With dead ends: 68 [2024-11-19 20:51:04,034 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 20:51:04,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:51:04,035 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:04,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:51:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 20:51:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 20:51:04,036 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) [2024-11-19 20:51:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 20:51:04,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2024-11-19 20:51:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:04,036 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 20:51:04,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:51:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 20:51:04,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 20:51:04,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 20:51:04,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 20:51:04,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:04,242 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2024-11-19 20:51:04,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 20:51:04,530 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 20:51:04,540 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 20:51:04,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-19 20:51:04,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-19 20:51:04,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-19 20:51:04,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!base [2024-11-19 20:51:04,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-11-19 20:51:04,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-19 20:51:04,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-11-19 20:51:04,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-19 20:51:04,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-19 20:51:04,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:51:04,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:51:04,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!offset [2024-11-19 20:51:04,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-19 20:51:04,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:51:04,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:51:04,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 20:51:04,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-11-19 20:51:04,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-19 20:51:04,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-19 20:51:04,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 20:51:04,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 20:51:04,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-11-19 20:51:04,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!base [2024-11-19 20:51:04,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-11-19 20:51:04,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:51:04,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:51:04,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-19 20:51:04,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-11-19 20:51:04,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!offset [2024-11-19 20:51:04,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-19 20:51:04,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-19 20:51:04,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 20:51:04,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-19 20:51:04,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-11-19 20:51:04,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-19 20:51:04,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-11-19 20:51:04,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!base [2024-11-19 20:51:04,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-11-19 20:51:04,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-19 20:51:04,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-19 20:51:04,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:51:04,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:51:04,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!offset [2024-11-19 20:51:04,552 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-19 20:51:04,552 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:51:04,552 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:51:04,552 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,553 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:51:04,553 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:51:04,553 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-19 20:51:04,554 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-19 20:51:04,554 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-19 20:51:04,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-19 20:51:04,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-19 20:51:04,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-19 20:51:04,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-19 20:51:04,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-19 20:51:04,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-19 20:51:04,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-19 20:51:04,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-19 20:51:04,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-19 20:51:04,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-19 20:51:04,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-19 20:51:04,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-19 20:51:04,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-19 20:51:04,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-19 20:51:04,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-19 20:51:04,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-19 20:51:04,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-19 20:51:04,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-19 20:51:04,564 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,565 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 20:51:04,565 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-11-19 20:51:04,565 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-19 20:51:04,565 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-19 20:51:04,565 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 20:51:04,565 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,569 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,569 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,569 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,569 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,569 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,570 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-11-19 20:51:04,570 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-19 20:51:04,570 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:51:04,570 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:51:04,570 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-11-19 20:51:04,570 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!base [2024-11-19 20:51:04,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 20:51:04,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-19 20:51:04,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-11-19 20:51:04,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-19 20:51:04,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!offset [2024-11-19 20:51:04,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-11-19 20:51:04,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-11-19 20:51:04,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 20:51:04,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:51:04,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:51:04,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:51:04,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:51:04,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:51:04,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~snd_to_last~0!base,]]] [2024-11-19 20:51:04,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!offset [2024-11-19 20:51:04,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-19 20:51:04,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-19 20:51:04,573 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-19 20:51:04,573 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] [2024-11-19 20:51:04,573 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!base [2024-11-19 20:51:04,574 WARN L156 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-19 20:51:04,576 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-19 20:51:04,577 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] [2024-11-19 20:51:04,577 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-19 20:51:04,577 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-19 20:51:04,577 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-19 20:51:04,578 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-19 20:51:04,578 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-19 20:51:04,578 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-19 20:51:04,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:51:04 BoogieIcfgContainer [2024-11-19 20:51:04,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 20:51:04,579 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 20:51:04,580 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 20:51:04,580 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 20:51:04,580 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:50:52" (3/4) ... [2024-11-19 20:51:04,582 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 20:51:04,585 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-19 20:51:04,587 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-19 20:51:04,587 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 20:51:04,588 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 20:51:04,588 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 20:51:04,656 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 20:51:04,656 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 20:51:04,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 20:51:04,657 INFO L158 Benchmark]: Toolchain (without parser) took 13156.20ms. Allocated memory was 186.6MB in the beginning and 352.3MB in the end (delta: 165.7MB). Free memory was 120.4MB in the beginning and 121.1MB in the end (delta: -722.9kB). Peak memory consumption was 165.3MB. Max. memory is 16.1GB. [2024-11-19 20:51:04,657 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 104.9MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 20:51:04,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.56ms. Allocated memory is still 186.6MB. Free memory was 120.2MB in the beginning and 100.2MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 20:51:04,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.55ms. Allocated memory is still 186.6MB. Free memory was 100.0MB in the beginning and 98.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:51:04,657 INFO L158 Benchmark]: Boogie Preprocessor took 119.62ms. Allocated memory is still 186.6MB. Free memory was 98.0MB in the beginning and 157.8MB in the end (delta: -59.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 20:51:04,658 INFO L158 Benchmark]: RCFGBuilder took 310.04ms. Allocated memory is still 186.6MB. Free memory was 157.1MB in the beginning and 140.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 20:51:04,658 INFO L158 Benchmark]: TraceAbstraction took 12247.67ms. Allocated memory was 186.6MB in the beginning and 352.3MB in the end (delta: 165.7MB). Free memory was 139.7MB in the beginning and 126.3MB in the end (delta: 13.4MB). Peak memory consumption was 182.2MB. Max. memory is 16.1GB. [2024-11-19 20:51:04,658 INFO L158 Benchmark]: Witness Printer took 76.79ms. Allocated memory is still 352.3MB. Free memory was 126.3MB in the beginning and 121.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 20:51:04,660 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 104.9MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.56ms. Allocated memory is still 186.6MB. Free memory was 120.2MB in the beginning and 100.2MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.55ms. Allocated memory is still 186.6MB. Free memory was 100.0MB in the beginning and 98.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.62ms. Allocated memory is still 186.6MB. Free memory was 98.0MB in the beginning and 157.8MB in the end (delta: -59.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 310.04ms. Allocated memory is still 186.6MB. Free memory was 157.1MB in the beginning and 140.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12247.67ms. Allocated memory was 186.6MB in the beginning and 352.3MB in the end (delta: 165.7MB). Free memory was 139.7MB in the beginning and 126.3MB in the end (delta: 13.4MB). Peak memory consumption was 182.2MB. Max. memory is 16.1GB. * Witness Printer took 76.79ms. Allocated memory is still 352.3MB. Free memory was 126.3MB in the beginning and 121.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~snd_to_last~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * 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: 624]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 1638 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1364 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1842 IncrementalHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 274 mSDtfsCounter, 1842 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 656 GetRequests, 485 SyntacticMatches, 4 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=9, InterpolantAutomatonStates: 95, 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, 11 MinimizatonAttempts, 30 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 756 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 864 ConstructedInterpolants, 21 QuantifiedInterpolants, 6779 SizeOfPredicates, 47 NumberOfNonLiveVariables, 2386 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 471/546 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: 597]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((2 <= len) && (len <= 1)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: ((((2 <= len) && (i == 0)) || (2 <= len)) || ((2 <= len) && (i <= 1))) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-19 20:51:04,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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