./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:00:24,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:00:24,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:00:24,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:00:24,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:00:24,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:00:24,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:00:24,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:00:24,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:00:24,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:00:24,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:00:24,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:00:24,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:00:24,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:00:24,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:00:24,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:00:24,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:00:24,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:00:24,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:00:24,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:00:24,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:00:24,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:00:24,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:00:24,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:00:24,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:00:24,624 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:00:24,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:00:24,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:00:24,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:00:24,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:00:24,625 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:00:24,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:00:24,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:00:24,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:00:24,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:00:24,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:00:24,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:00:24,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:00:24,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:00:24,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:00:24,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:00:24,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:00:24,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:00:24,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:00:24,627 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 ! overflow) ) 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2024-11-12 17:00:24,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:00:24,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:00:24,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:00:24,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:00:24,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:00:24,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-11-12 17:00:26,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:00:26,200 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:00:26,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-11-12 17:00:26,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8cc78179/dece905393664c80b2fca27197a0df72/FLAG1e9c18d7f [2024-11-12 17:00:26,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8cc78179/dece905393664c80b2fca27197a0df72 [2024-11-12 17:00:26,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:00:26,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:00:26,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:00:26,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:00:26,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:00:26,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7440cf1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26, skipping insertion in model container [2024-11-12 17:00:26,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:00:26,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:00:26,533 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:00:26,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:00:26,588 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:00:26,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26 WrapperNode [2024-11-12 17:00:26,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:00:26,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:00:26,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:00:26,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:00:26,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,620 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 122 [2024-11-12 17:00:26,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:00:26,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:00:26,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:00:26,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:00:26,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,644 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-12 17:00:26,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:00:26,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:00:26,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:00:26,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:00:26,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (1/1) ... [2024-11-12 17:00:26,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:00:26,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:26,691 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-12 17:00:26,694 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-12 17:00:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-12 17:00:26,731 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 17:00:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 17:00:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 17:00:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 17:00:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 17:00:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 17:00:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 17:00:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 17:00:26,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 17:00:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:00:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 17:00:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 17:00:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:00:26,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:00:26,862 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:00:26,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:00:27,026 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-12 17:00:27,026 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:00:27,034 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:00:27,035 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 17:00:27,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:00:27 BoogieIcfgContainer [2024-11-12 17:00:27,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:00:27,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:00:27,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:00:27,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:00:27,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:00:26" (1/3) ... [2024-11-12 17:00:27,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100b5fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:00:27, skipping insertion in model container [2024-11-12 17:00:27,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:26" (2/3) ... [2024-11-12 17:00:27,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100b5fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:00:27, skipping insertion in model container [2024-11-12 17:00:27,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:00:27" (3/3) ... [2024-11-12 17:00:27,043 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2024-11-12 17:00:27,054 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:00:27,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 17:00:27,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:00:27,120 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;@61691117, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:00:27,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 17:00:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 37 states have internal predecessors, (48), 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-12 17:00:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 17:00:27,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:27,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:27,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:27,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash -138938836, now seen corresponding path program 1 times [2024-11-12 17:00:27,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:27,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961236123] [2024-11-12 17:00:27,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:27,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,445 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-12 17:00:27,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:27,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961236123] [2024-11-12 17:00:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961236123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:27,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:27,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:27,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301245959] [2024-11-12 17:00:27,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:27,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:27,475 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 37 states have internal predecessors, (48), 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 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-12 17:00:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:27,556 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-11-12 17:00:27,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:27,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-11-12 17:00:27,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:27,564 INFO L225 Difference]: With dead ends: 78 [2024-11-12 17:00:27,564 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 17:00:27,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:27,569 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:27,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 17:00:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-11-12 17:00:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 31 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-12 17:00:27,596 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 12 [2024-11-12 17:00:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:27,597 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-12 17:00:27,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-12 17:00:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-12 17:00:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 17:00:27,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:27,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:27,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:00:27,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:27,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash -12136572, now seen corresponding path program 1 times [2024-11-12 17:00:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:27,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7052196] [2024-11-12 17:00:27,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:27,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,773 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-12 17:00:27,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:27,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7052196] [2024-11-12 17:00:27,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7052196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:27,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:27,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652072165] [2024-11-12 17:00:27,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:27,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:27,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:27,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:27,776 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12 17:00:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:27,823 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-12 17:00:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:27,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-11-12 17:00:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:27,824 INFO L225 Difference]: With dead ends: 38 [2024-11-12 17:00:27,824 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 17:00:27,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:27,825 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:27,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 17:00:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 17:00:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-12 17:00:27,832 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 13 [2024-11-12 17:00:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:27,833 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-12 17:00:27,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12 17:00:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-12 17:00:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 17:00:27,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:27,835 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-12 17:00:27,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:00:27,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:27,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1183610734, now seen corresponding path program 1 times [2024-11-12 17:00:27,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145645372] [2024-11-12 17:00:27,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:27,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 17:00:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:27,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145645372] [2024-11-12 17:00:27,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145645372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:27,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:27,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159015605] [2024-11-12 17:00:27,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:27,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:27,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:27,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:27,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:27,953 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-12 17:00:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:27,998 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-12 17:00:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:27,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-12 17:00:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:28,000 INFO L225 Difference]: With dead ends: 37 [2024-11-12 17:00:28,000 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 17:00:28,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:28,001 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:28,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 17:00:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 17:00:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-12 17:00:28,008 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2024-11-12 17:00:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:28,008 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-12 17:00:28,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-12 17:00:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-12 17:00:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 17:00:28,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:28,011 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-12 17:00:28,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 17:00:28,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:28,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:28,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1962772862, now seen corresponding path program 1 times [2024-11-12 17:00:28,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:28,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250733670] [2024-11-12 17:00:28,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:28,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 17:00:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 17:00:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250733670] [2024-11-12 17:00:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250733670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590215845] [2024-11-12 17:00:28,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:28,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:28,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:28,172 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-12 17:00:28,174 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-12 17:00:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 17:00:28,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 17:00:28,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:00:28,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590215845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:28,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:00:28,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-12 17:00:28,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530417197] [2024-11-12 17:00:28,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:28,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:00:28,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:28,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:00:28,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:00:28,331 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-12 17:00:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:28,364 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-12 17:00:28,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:00:28,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-12 17:00:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:28,365 INFO L225 Difference]: With dead ends: 36 [2024-11-12 17:00:28,365 INFO L226 Difference]: Without dead ends: 35 [2024-11-12 17:00:28,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:00:28,366 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:28,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-12 17:00:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2024-11-12 17:00:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 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-12 17:00:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-12 17:00:28,374 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2024-11-12 17:00:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:28,374 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-12 17:00:28,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-12 17:00:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-12 17:00:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 17:00:28,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:28,375 INFO L218 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] [2024-11-12 17:00:28,390 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-12 17:00:28,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:28,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:28,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:28,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1052290161, now seen corresponding path program 1 times [2024-11-12 17:00:28,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:28,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965859714] [2024-11-12 17:00:28,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:28,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 17:00:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,702 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-12 17:00:28,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:28,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965859714] [2024-11-12 17:00:28,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965859714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:28,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187847237] [2024-11-12 17:00:28,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:28,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:28,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:28,705 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-12 17:00:28,706 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-12 17:00:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:00:28,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:28,822 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-12 17:00:28,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:00:28,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187847237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:28,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:00:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2024-11-12 17:00:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929722724] [2024-11-12 17:00:28,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:28,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:00:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:28,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:00:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:28,824 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-12 17:00:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:28,831 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-12 17:00:28,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:00:28,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 27 [2024-11-12 17:00:28,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:28,832 INFO L225 Difference]: With dead ends: 30 [2024-11-12 17:00:28,832 INFO L226 Difference]: Without dead ends: 29 [2024-11-12 17:00:28,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:28,833 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:28,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:28,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-12 17:00:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-12 17:00:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 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-12 17:00:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-12 17:00:28,838 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2024-11-12 17:00:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:28,838 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-12 17:00:28,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-12 17:00:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-12 17:00:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 17:00:28,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:28,839 INFO L218 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] [2024-11-12 17:00:28,852 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-12 17:00:29,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:29,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:29,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1738743465, now seen corresponding path program 1 times [2024-11-12 17:00:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:29,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097695957] [2024-11-12 17:00:29,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:29,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 17:00:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,156 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-12 17:00:29,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:29,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097695957] [2024-11-12 17:00:29,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097695957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:29,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087658680] [2024-11-12 17:00:29,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:29,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:29,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:29,160 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-12 17:00:29,161 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-12 17:00:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:00:29,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:29,303 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-12 17:00:29,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:00:29,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087658680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:29,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:00:29,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2024-11-12 17:00:29,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452206316] [2024-11-12 17:00:29,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:29,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:00:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:29,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:00:29,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:29,305 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-12 17:00:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:29,308 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-12 17:00:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:00:29,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 28 [2024-11-12 17:00:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:29,309 INFO L225 Difference]: With dead ends: 29 [2024-11-12 17:00:29,310 INFO L226 Difference]: Without dead ends: 26 [2024-11-12 17:00:29,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:29,311 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:29,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-12 17:00:29,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-12 17:00:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 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-12 17:00:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-12 17:00:29,317 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 28 [2024-11-12 17:00:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:29,317 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-12 17:00:29,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-12 17:00:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-12 17:00:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 17:00:29,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:29,318 INFO L218 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] [2024-11-12 17:00:29,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 17:00:29,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:29,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:29,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:29,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1738745099, now seen corresponding path program 1 times [2024-11-12 17:00:29,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:29,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85493001] [2024-11-12 17:00:29,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:29,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 17:00:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,619 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-12 17:00:29,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:29,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85493001] [2024-11-12 17:00:29,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85493001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:29,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388596483] [2024-11-12 17:00:29,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:29,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:29,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:29,621 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-12 17:00:29,623 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-12 17:00:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 17:00:29,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:00:29,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:29,791 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-12 17:00:29,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388596483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:29,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:29,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-12 17:00:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455923359] [2024-11-12 17:00:29,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:29,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 17:00:29,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:29,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 17:00:29,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:00:29,796 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 17:00:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:29,838 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-12 17:00:29,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:00:29,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-12 17:00:29,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:29,840 INFO L225 Difference]: With dead ends: 49 [2024-11-12 17:00:29,840 INFO L226 Difference]: Without dead ends: 32 [2024-11-12 17:00:29,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:00:29,841 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:29,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-12 17:00:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-12 17:00:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 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-12 17:00:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-12 17:00:29,844 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 28 [2024-11-12 17:00:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:29,845 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-12 17:00:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 17:00:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-12 17:00:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 17:00:29,846 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:29,846 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:29,859 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-12 17:00:30,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:30,047 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:30,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:30,047 INFO L85 PathProgramCache]: Analyzing trace with hash -215948723, now seen corresponding path program 2 times [2024-11-12 17:00:30,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:30,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090240249] [2024-11-12 17:00:30,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 17:00:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 17:00:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:30,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:30,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090240249] [2024-11-12 17:00:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090240249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:30,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:30,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979925680] [2024-11-12 17:00:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:30,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:30,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:30,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:30,139 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-12 17:00:30,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:30,162 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-12 17:00:30,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:30,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 39 [2024-11-12 17:00:30,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:30,163 INFO L225 Difference]: With dead ends: 38 [2024-11-12 17:00:30,163 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 17:00:30,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:30,164 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:30,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 17:00:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 17:00:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-12 17:00:30,168 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 39 [2024-11-12 17:00:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:30,168 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-12 17:00:30,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-12 17:00:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-12 17:00:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-12 17:00:30,171 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:30,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:30,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 17:00:30,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:30,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash -666706490, now seen corresponding path program 1 times [2024-11-12 17:00:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:30,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349353987] [2024-11-12 17:00:30,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:30,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 17:00:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 17:00:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:30,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:30,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349353987] [2024-11-12 17:00:30,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349353987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:30,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390477363] [2024-11-12 17:00:30,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:30,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:30,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:30,296 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-12 17:00:30,297 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-12 17:00:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:00:30,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:30,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:00:30,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390477363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:30,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:00:30,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-12 17:00:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293871788] [2024-11-12 17:00:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:30,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:00:30,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:30,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:00:30,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:00:30,450 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-12 17:00:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:30,469 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-12 17:00:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:00:30,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 43 [2024-11-12 17:00:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:30,470 INFO L225 Difference]: With dead ends: 36 [2024-11-12 17:00:30,470 INFO L226 Difference]: Without dead ends: 35 [2024-11-12 17:00:30,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:00:30,470 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:30,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-12 17:00:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-12 17:00:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-12 17:00:30,478 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 43 [2024-11-12 17:00:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:30,478 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-12 17:00:30,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-12 17:00:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-12 17:00:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 17:00:30,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:30,480 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:30,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 17:00:30,681 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-12 17:00:30,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:30,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash 806935371, now seen corresponding path program 1 times [2024-11-12 17:00:30,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:30,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114400247] [2024-11-12 17:00:30,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:30,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 17:00:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 17:00:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:30,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:30,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114400247] [2024-11-12 17:00:30,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114400247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:30,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774454724] [2024-11-12 17:00:30,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:30,770 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-12 17:00:30,771 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-12 17:00:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:00:30,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:30,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774454724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:30,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:30,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-12 17:00:30,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629189586] [2024-11-12 17:00:30,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:30,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 17:00:30,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 17:00:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:00:30,964 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-12 17:00:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:31,011 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-11-12 17:00:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 17:00:31,012 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 44 [2024-11-12 17:00:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:31,012 INFO L225 Difference]: With dead ends: 48 [2024-11-12 17:00:31,012 INFO L226 Difference]: Without dead ends: 47 [2024-11-12 17:00:31,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:00:31,013 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:31,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-12 17:00:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-12 17:00:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-12 17:00:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-11-12 17:00:31,016 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2024-11-12 17:00:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:31,017 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-12 17:00:31,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-12 17:00:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-11-12 17:00:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 17:00:31,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:31,017 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:31,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 17:00:31,218 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-12 17:00:31,218 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:31,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:31,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1374211776, now seen corresponding path program 2 times [2024-11-12 17:00:31,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:31,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633924171] [2024-11-12 17:00:31,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 17:00:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 17:00:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:31,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:31,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633924171] [2024-11-12 17:00:31,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633924171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:31,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945884058] [2024-11-12 17:00:31,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:00:31,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:31,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:31,381 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-12 17:00:31,382 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-12 17:00:31,534 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 17:00:31,535 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:00:31,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 17:00:31,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:31,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:31,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945884058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:31,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:31,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-11-12 17:00:31,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746060941] [2024-11-12 17:00:31,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:31,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 17:00:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 17:00:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-11-12 17:00:31,752 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 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-12 17:00:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:31,807 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-11-12 17:00:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 17:00:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 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 56 [2024-11-12 17:00:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:31,812 INFO L225 Difference]: With dead ends: 72 [2024-11-12 17:00:31,812 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 17:00:31,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-11-12 17:00:31,812 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:31,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 17:00:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-12 17:00:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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-12 17:00:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-12 17:00:31,820 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 56 [2024-11-12 17:00:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:31,820 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-12 17:00:31,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 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-12 17:00:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-12 17:00:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 17:00:31,821 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:31,821 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:31,834 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-12 17:00:32,021 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-12 17:00:32,022 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:00:32,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1399604906, now seen corresponding path program 3 times [2024-11-12 17:00:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:32,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082389712] [2024-11-12 17:00:32,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:00:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 17:00:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:32,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 17:00:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082389712] [2024-11-12 17:00:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082389712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575021604] [2024-11-12 17:00:32,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 17:00:32,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:32,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:32,440 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:32,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 17:00:33,107 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-12 17:00:33,107 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:00:33,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-11-12 17:00:33,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:33,162 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-12 17:00:33,244 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 11 treesize of output 7 [2024-11-12 17:00:33,248 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 11 treesize of output 7 [2024-11-12 17:00:33,430 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 17:00:33,431 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 16 treesize of output 15 [2024-11-12 17:00:33,453 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 17:00:33,454 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 16 treesize of output 15 [2024-11-12 17:00:33,469 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 17:00:33,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 17:00:33,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 15 [2024-11-12 17:00:33,535 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 23 treesize of output 22 [2024-11-12 17:00:33,775 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-12 17:00:33,775 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 60 treesize of output 27 [2024-11-12 17:00:33,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 17:00:33,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-12 17:00:33,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 17:00:33,960 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-12 17:00:33,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-12 17:00:33,981 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-12 17:00:33,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2024-11-12 17:00:34,007 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-12 17:00:34,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-12 17:00:34,108 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-12 17:00:34,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-12 17:00:34,126 INFO L349 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2024-11-12 17:00:34,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 69 [2024-11-12 17:00:34,134 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 0 case distinctions, treesize of input 122 treesize of output 75 [2024-11-12 17:00:34,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2024-11-12 17:00:34,230 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 180 treesize of output 136 [2024-11-12 17:00:34,236 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 140 treesize of output 104 [2024-11-12 17:00:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 85 proven. 22 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-12 17:00:34,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:01:40,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 17:01:40,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 451 treesize of output 435 [2024-11-12 17:01:40,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 17:01:40,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 388 treesize of output 372 [2024-11-12 17:01:40,969 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-12 17:01:40,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 35 treesize of output 8 [2024-11-12 17:01:41,014 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-12 17:01:41,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 35 treesize of output 8 [2024-11-12 17:01:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575021604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:01:41,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 17:01:41,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2024-11-12 17:01:41,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903040303] [2024-11-12 17:01:41,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 17:01:41,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-12 17:01:41,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:41,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-12 17:01:41,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2731, Unknown=9, NotChecked=0, Total=2970 [2024-11-12 17:01:41,382 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 42 states have internal predecessors, (104), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-12 17:01:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:45,404 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2024-11-12 17:01:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-12 17:01:45,404 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 42 states have internal predecessors, (104), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 80 [2024-11-12 17:01:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:45,405 INFO L225 Difference]: With dead ends: 139 [2024-11-12 17:01:45,405 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 17:01:45,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 68.7s TimeCoverageRelationStatistics Valid=368, Invalid=4045, Unknown=9, NotChecked=0, Total=4422 [2024-11-12 17:01:45,406 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:45,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 547 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-12 17:01:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 17:01:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-12 17:01:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 75 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:01:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-12 17:01:45,416 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 80 [2024-11-12 17:01:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:45,416 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-12 17:01:45,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 42 states have internal predecessors, (104), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-12 17:01:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-12 17:01:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 17:01:45,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:45,419 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 11, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:45,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-12 17:01:45,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-12 17:01:45,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:01:45,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1935419757, now seen corresponding path program 4 times [2024-11-12 17:01:45,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831689418] [2024-11-12 17:01:45,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:01:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 17:01:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:45,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 17:01:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:45,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 17:01:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2024-11-12 17:01:45,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:45,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831689418] [2024-11-12 17:01:45,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831689418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:01:45,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783198693] [2024-11-12 17:01:45,793 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 17:01:45,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:45,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:01:45,795 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:01:45,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 17:01:45,989 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 17:01:45,989 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:01:45,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 173 conjuncts are in the unsatisfiable core [2024-11-12 17:01:46,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:01:46,020 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-12 17:01:46,064 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 11 treesize of output 7 [2024-11-12 17:01:46,067 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 11 treesize of output 7 [2024-11-12 17:01:46,185 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 17:01:46,185 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 16 treesize of output 15 [2024-11-12 17:01:46,198 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 17:01:46,198 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 16 treesize of output 15 [2024-11-12 17:01:46,211 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 17:01:46,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 17:01:46,250 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 23 treesize of output 22 [2024-11-12 17:01:46,259 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 15 [2024-11-12 17:01:46,397 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-12 17:01:46,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-12 17:01:46,411 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-12 17:01:46,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2024-11-12 17:01:46,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-12 17:01:46,506 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-12 17:01:46,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 49 [2024-11-12 17:01:46,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2024-11-12 17:01:46,740 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-12 17:01:46,741 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 54 [2024-11-12 17:01:46,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2024-11-12 17:01:46,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-12 17:01:46,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 17:01:46,954 INFO L349 Elim1Store]: treesize reduction 148, result has 9.2 percent of original size [2024-11-12 17:01:46,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 148 treesize of output 80 [2024-11-12 17:01:46,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 17:01:47,020 INFO L349 Elim1Store]: treesize reduction 294, result has 24.2 percent of original size [2024-11-12 17:01:47,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 112 [2024-11-12 17:01:47,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 17:01:47,069 INFO L349 Elim1Store]: treesize reduction 12, result has 75.5 percent of original size [2024-11-12 17:01:47,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 49 [2024-11-12 17:01:47,195 INFO L349 Elim1Store]: treesize reduction 160, result has 8.6 percent of original size [2024-11-12 17:01:47,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 180 treesize of output 101 [2024-11-12 17:01:47,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 17:01:47,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 75 [2024-11-12 17:01:47,209 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 0 case distinctions, treesize of input 193 treesize of output 130 [2024-11-12 17:01:47,245 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-12 17:01:47,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-12 17:01:47,312 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 291 treesize of output 227 [2024-11-12 17:01:47,315 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 231 treesize of output 179 [2024-11-12 17:01:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 126 proven. 48 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-12 17:01:48,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:01:50,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783198693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:01:50,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 17:01:50,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 29] total 35 [2024-11-12 17:01:50,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123097254] [2024-11-12 17:01:50,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 17:01:50,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-12 17:01:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:50,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-12 17:01:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1786, Unknown=0, NotChecked=0, Total=1892 [2024-11-12 17:01:50,930 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 28 states have internal predecessors, (79), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 17:01:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:51,987 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2024-11-12 17:01:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 17:01:51,987 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 28 states have internal predecessors, (79), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 95 [2024-11-12 17:01:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:51,987 INFO L225 Difference]: With dead ends: 86 [2024-11-12 17:01:51,987 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:01:51,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=149, Invalid=2607, Unknown=0, NotChecked=0, Total=2756 [2024-11-12 17:01:51,988 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:51,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 17:01:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:01:51,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:01:51,989 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-12 17:01:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:01:51,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2024-11-12 17:01:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:51,989 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:01:51,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 28 states have internal predecessors, (79), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 17:01:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:01:51,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:01:51,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-12 17:01:51,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-12 17:01:51,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-12 17:01:51,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-12 17:01:51,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-12 17:01:51,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-12 17:01:52,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 17:01:52,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-12 17:01:52,196 INFO L421 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:52,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:01:52,385 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:01:52,403 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-12 17:01:52,404 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,404 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,404 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,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-12 17:01:52,404 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-12 17:01:52,404 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-12 17:01:52,404 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-12 17:01:52,405 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,405 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,405 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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] [2024-11-12 17:01:52,405 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-12 17:01:52,405 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-12 17:01:52,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-12 17:01:52,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-12 17:01:52,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,406 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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] [2024-11-12 17:01:52,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,406 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,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-12 17:01:52,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,407 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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] [2024-11-12 17:01:52,407 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,407 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,407 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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] [2024-11-12 17:01:52,407 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,407 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,407 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,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-12 17:01:52,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,409 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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] [2024-11-12 17:01:52,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,409 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,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-12 17:01:52,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-12 17:01:52,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,410 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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,410 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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-12 17:01:52,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,411 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,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-12 17:01:52,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,411 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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] [2024-11-12 17:01:52,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,411 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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] [2024-11-12 17:01:52,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,411 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,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-12 17:01:52,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,412 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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] [2024-11-12 17:01:52,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,412 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,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-12 17:01:52,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-12 17:01:52,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-12 17:01:52,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-12 17:01:52,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,413 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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] [2024-11-12 17:01:52,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-12 17:01:52,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-12 17:01:52,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-12 17:01:52,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-12 17:01:52,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,413 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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] [2024-11-12 17:01:52,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-12 17:01:52,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,414 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,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-12 17:01:52,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,414 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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] [2024-11-12 17:01:52,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,415 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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] [2024-11-12 17:01:52,415 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,415 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,415 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,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-12 17:01:52,415 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,415 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,415 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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] [2024-11-12 17:01:52,417 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,417 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,417 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],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-12 17:01:52,418 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-12 17:01:52,418 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-12 17:01:52,418 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-12 17:01:52,418 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,419 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],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-12 17:01:52,419 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-12 17:01:52,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-12 17:01:52,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-12 17:01:52,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-12 17:01:52,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-12 17:01:52,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-12 17:01:52,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-12 17:01:52,422 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-12 17:01:52,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-12 17:01:52,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-12 17:01:52,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-12 17:01:52,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] [2024-11-12 17:01:52,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-12 17:01:52,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-12 17:01:52,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-12 17:01:52,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-12 17:01:52,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-12 17:01:52,427 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-12 17:01:52,427 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-12 17:01:52,427 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-12 17:01:52,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:01:52 BoogieIcfgContainer [2024-11-12 17:01:52,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:01:52,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:01:52,428 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:01:52,428 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:01:52,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:00:27" (3/4) ... [2024-11-12 17:01:52,431 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:01:52,434 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-12 17:01:52,439 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-12 17:01:52,439 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-12 17:01:52,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:01:52,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:01:52,521 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:01:52,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:01:52,522 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:01:52,522 INFO L158 Benchmark]: Toolchain (without parser) took 86300.54ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 112.1MB in the beginning and 96.3MB in the end (delta: 15.8MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2024-11-12 17:01:52,523 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:01:52,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.65ms. Allocated memory is still 172.0MB. Free memory was 112.1MB in the beginning and 137.4MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 17:01:52,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.13ms. Allocated memory is still 172.0MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:01:52,523 INFO L158 Benchmark]: Boogie Preprocessor took 43.90ms. Allocated memory is still 172.0MB. Free memory was 135.3MB in the beginning and 132.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 17:01:52,524 INFO L158 Benchmark]: RCFGBuilder took 371.15ms. Allocated memory is still 172.0MB. Free memory was 132.3MB in the beginning and 114.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 17:01:52,526 INFO L158 Benchmark]: TraceAbstraction took 85389.37ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 113.4MB in the beginning and 102.6MB in the end (delta: 10.8MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2024-11-12 17:01:52,526 INFO L158 Benchmark]: Witness Printer took 94.26ms. Allocated memory is still 255.9MB. Free memory was 102.6MB in the beginning and 96.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 17:01:52,527 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.66ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.65ms. Allocated memory is still 172.0MB. Free memory was 112.1MB in the beginning and 137.4MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.13ms. Allocated memory is still 172.0MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.90ms. Allocated memory is still 172.0MB. Free memory was 135.3MB in the beginning and 132.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 371.15ms. Allocated memory is still 172.0MB. Free memory was 132.3MB in the beginning and 114.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 85389.37ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 113.4MB in the beginning and 102.6MB in the end (delta: 10.8MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. * Witness Printer took 94.26ms. Allocated memory is still 255.9MB. Free memory was 102.6MB in the beginning and 96.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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,]]],[IdentifierExpression[~#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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] - 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: ~ptr~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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] - 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,]]],[IdentifierExpression[~#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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] - 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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] - 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,]]],[IdentifierExpression[~#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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] - 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,]]],[IdentifierExpression[~#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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] - 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: ~ptr~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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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,]]],[IdentifierExpression[~#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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] - 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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] - 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,]]],[IdentifierExpression[~#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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] - 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,]]],[IdentifierExpression[~#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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] - 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: ~ptr~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,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~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,]]],[IdentifierExpression[~#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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]] - 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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] - 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,]]],[IdentifierExpression[~#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$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]],IntegerLiteral[4]]]]]],[IntegerLiteral[4]]]]] - 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],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - 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!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],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~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],[IdentifierExpression[~head~0!base,]]] - 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: #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],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - 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!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],[IdentifierExpression[~head~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],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - 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: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - 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: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 624]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 624]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 85.1s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 1629 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1312 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1762 IncrementalHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 317 mSDtfsCounter, 1762 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 803 GetRequests, 612 SyntacticMatches, 3 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 73.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=12, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 75.4s InterpolantComputationTime, 937 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1040 ConstructedInterpolants, 26 QuantifiedInterpolants, 8132 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3167 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 1094/1535 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 6 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((len == 2) && (2 == count)) || ((count == 1) && (len == 2))) || (((count <= 3) && (2 <= count)) && (len == 2))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((len <= 0) && (len == 2)) || ((2 == len) && (len == 2))) || ((len == 1) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:01:52,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE