./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:59:44,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:59:44,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:59:44,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:59:44,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:59:44,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:59:44,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:59:44,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:59:44,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:59:44,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:59:44,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:59:44,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:59:44,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:59:44,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:59:44,700 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:59:44,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:59:44,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:59:44,701 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:59:44,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:59:44,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:59:44,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:59:44,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:59:44,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:59:44,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:59:44,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:59:44,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:59:44,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:59:44,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:59:44,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:59:44,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:59:44,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:59:44,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:59:44,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:59:44,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:59:44,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:59:44,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:59:44,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:59:44,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:59:44,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:59:44,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:59:44,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:59:44,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:59:44,709 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2024-11-08 13:59:44,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:59:44,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:59:44,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:59:45,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:59:45,000 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:59:45,002 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-08 13:59:46,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:59:46,630 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:59:46,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-11-08 13:59:46,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1495ce61d/97ae660e1e5f449d8376f3a4ad9dcc6e/FLAG83ea95ffd [2024-11-08 13:59:46,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1495ce61d/97ae660e1e5f449d8376f3a4ad9dcc6e [2024-11-08 13:59:46,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:59:46,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:59:46,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:59:46,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:59:46,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:59:46,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:59:46" (1/1) ... [2024-11-08 13:59:46,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@232d999c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:46, skipping insertion in model container [2024-11-08 13:59:46,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:59:46" (1/1) ... [2024-11-08 13:59:47,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:59:47,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2024-11-08 13:59:47,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:59:47,439 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:59:47,488 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2024-11-08 13:59:47,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:59:47,521 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:59:47,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47 WrapperNode [2024-11-08 13:59:47,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:59:47,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:59:47,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:59:47,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:59:47,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,575 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-11-08 13:59:47,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:59:47,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:59:47,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:59:47,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:59:47,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,612 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-08 13:59:47,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,620 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:59:47,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:59:47,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:59:47,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:59:47,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (1/1) ... [2024-11-08 13:59:47,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:59:47,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:47,684 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-08 13:59:47,691 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-08 13:59:47,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:59:47,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:59:47,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:59:47,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:59:47,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:59:47,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:59:47,747 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 13:59:47,747 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 13:59:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:59:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:59:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:59:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:59:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:59:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:59:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:59:47,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:59:47,911 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:59:47,913 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:59:48,128 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-08 13:59:48,128 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:59:48,145 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:59:48,146 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 13:59:48,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:59:48 BoogieIcfgContainer [2024-11-08 13:59:48,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:59:48,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:59:48,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:59:48,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:59:48,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:59:46" (1/3) ... [2024-11-08 13:59:48,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634d5e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:59:48, skipping insertion in model container [2024-11-08 13:59:48,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:47" (2/3) ... [2024-11-08 13:59:48,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634d5e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:59:48, skipping insertion in model container [2024-11-08 13:59:48,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:59:48" (3/3) ... [2024-11-08 13:59:48,154 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2024-11-08 13:59:48,171 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:59:48,171 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:59:48,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:59:48,240 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;@1ab59255, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:59:48,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:59:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:59:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 13:59:48,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:48,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:48,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:48,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash 535821778, now seen corresponding path program 1 times [2024-11-08 13:59:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:48,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166985129] [2024-11-08 13:59:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:48,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:59:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:48,562 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-08 13:59:48,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:48,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166985129] [2024-11-08 13:59:48,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166985129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:48,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:48,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:59:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723557191] [2024-11-08 13:59:48,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:48,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:59:48,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:48,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:59:48,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:59:48,598 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-08 13:59:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:48,661 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2024-11-08 13:59:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:59:48,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 15 [2024-11-08 13:59:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:48,671 INFO L225 Difference]: With dead ends: 50 [2024-11-08 13:59:48,671 INFO L226 Difference]: Without dead ends: 22 [2024-11-08 13:59:48,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:59:48,679 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:48,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-08 13:59:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-08 13:59:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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-08 13:59:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-08 13:59:48,708 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-11-08 13:59:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:48,709 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-08 13:59:48,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-08 13:59:48,709 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-08 13:59:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 13:59:48,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:48,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:48,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:59:48,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:48,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1411921462, now seen corresponding path program 1 times [2024-11-08 13:59:48,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:48,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836088058] [2024-11-08 13:59:48,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:59:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:48,973 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-08 13:59:48,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:48,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836088058] [2024-11-08 13:59:48,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836088058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:48,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:48,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:59:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225671917] [2024-11-08 13:59:48,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:48,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:59:48,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:48,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:59:48,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:59:48,980 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-08 13:59:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:49,032 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-08 13:59:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:59:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2024-11-08 13:59:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:49,033 INFO L225 Difference]: With dead ends: 42 [2024-11-08 13:59:49,033 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 13:59:49,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:59:49,035 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:49,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 13:59:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-08 13:59:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-08 13:59:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-08 13:59:49,047 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2024-11-08 13:59:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:49,048 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-08 13:59:49,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-08 13:59:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-08 13:59:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:59:49,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:49,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:49,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:59:49,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:49,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:49,053 INFO L85 PathProgramCache]: Analyzing trace with hash 340179466, now seen corresponding path program 1 times [2024-11-08 13:59:49,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:49,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858853845] [2024-11-08 13:59:49,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:49,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 13:59:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:49,311 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-08 13:59:49,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:49,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858853845] [2024-11-08 13:59:49,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858853845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:49,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845904012] [2024-11-08 13:59:49,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:49,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:49,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:49,315 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-08 13:59:49,316 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-08 13:59:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:49,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 13:59:49,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:49,534 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-08 13:59:49,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:49,594 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-08 13:59:49,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845904012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:59:49,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:59:49,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-08 13:59:49,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096882172] [2024-11-08 13:59:49,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:59:49,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:59:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:49,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:59:49,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:59:49,597 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-08 13:59:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:49,648 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-08 13:59:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:59:49,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 24 [2024-11-08 13:59:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:49,649 INFO L225 Difference]: With dead ends: 43 [2024-11-08 13:59:49,650 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 13:59:49,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:59:49,651 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:49,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 13:59:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 13:59:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-08 13:59:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-08 13:59:49,660 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 24 [2024-11-08 13:59:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:49,660 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-08 13:59:49,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-08 13:59:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-08 13:59:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 13:59:49,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:49,663 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:49,684 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-08 13:59:49,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:49,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:49,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash 872550858, now seen corresponding path program 2 times [2024-11-08 13:59:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:49,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421820521] [2024-11-08 13:59:49,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:49,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:50,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:50,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:59:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:50,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:59:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 13:59:50,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421820521] [2024-11-08 13:59:50,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421820521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:50,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:50,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 13:59:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025857831] [2024-11-08 13:59:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:50,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 13:59:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:50,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 13:59:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:59:50,671 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:59:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:50,799 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-08 13:59:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 13:59:50,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-08 13:59:50,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:50,802 INFO L225 Difference]: With dead ends: 29 [2024-11-08 13:59:50,802 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 13:59:50,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:59:50,803 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:50,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:59:50,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 13:59:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 13:59:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-08 13:59:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-08 13:59:50,814 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2024-11-08 13:59:50,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:50,815 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-08 13:59:50,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:59:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-08 13:59:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 13:59:50,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:50,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:50,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:59:50,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:50,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1002784155, now seen corresponding path program 1 times [2024-11-08 13:59:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:50,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351107889] [2024-11-08 13:59:50,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:50,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:51,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:59:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:51,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:59:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:59:51,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:51,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351107889] [2024-11-08 13:59:51,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351107889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:51,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311095524] [2024-11-08 13:59:51,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:51,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:51,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:51,752 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-08 13:59:51,753 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-08 13:59:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:51,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-08 13:59:51,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:51,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:59:52,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 13:59:52,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2024-11-08 13:59:52,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 13:59:52,406 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 13:59:52,407 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 13:59:52,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-08 13:59:52,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2024-11-08 13:59:52,563 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-08 13:59:52,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 94 [2024-11-08 13:59:52,588 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-08 13:59:52,589 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 30 treesize of output 22 [2024-11-08 13:59:53,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:53,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 212 treesize of output 300 [2024-11-08 13:59:53,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:53,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 124 [2024-11-08 13:59:53,477 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-11-08 13:59:53,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 47 [2024-11-08 13:59:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:59:53,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:53,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:53,667 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-08 13:59:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311095524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:53,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:59:53,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 27 [2024-11-08 13:59:53,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543032740] [2024-11-08 13:59:53,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:59:53,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 13:59:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 13:59:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=797, Unknown=1, NotChecked=0, Total=870 [2024-11-08 13:59:53,788 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 27 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:59:57,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 14:00:02,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 14:00:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:02,759 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-08 14:00:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 14:00:02,760 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2024-11-08 14:00:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:02,762 INFO L225 Difference]: With dead ends: 37 [2024-11-08 14:00:02,762 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 14:00:02,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=133, Invalid=1426, Unknown=1, NotChecked=0, Total=1560 [2024-11-08 14:00:02,763 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:02,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 413 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2024-11-08 14:00:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 14:00:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-08 14:00:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:00:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-08 14:00:02,771 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 35 [2024-11-08 14:00:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:02,771 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-08 14:00:02,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 14:00:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-08 14:00:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 14:00:02,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:02,772 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:02,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 14:00:02,974 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-08 14:00:02,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:02,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1002785829, now seen corresponding path program 1 times [2024-11-08 14:00:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:02,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55674927] [2024-11-08 14:00:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:02,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:04,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:04,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:04,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 14:00:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:04,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55674927] [2024-11-08 14:00:04,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55674927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:04,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596813749] [2024-11-08 14:00:04,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:04,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:04,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:04,290 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-08 14:00:04,291 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-08 14:00:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:04,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-08 14:00:04,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:04,487 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-08 14:00:04,500 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-08 14:00:04,549 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 11 [2024-11-08 14:00:04,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 14:00:04,733 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 11 treesize of output 3 [2024-11-08 14:00:04,888 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 14:00:04,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 14:00:04,906 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 20 treesize of output 15 [2024-11-08 14:00:04,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-08 14:00:04,974 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 60 treesize of output 33 [2024-11-08 14:00:04,981 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 38 treesize of output 25 [2024-11-08 14:00:05,006 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-08 14:00:05,006 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-08 14:00:05,015 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 25 treesize of output 17 [2024-11-08 14:00:05,074 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 68 treesize of output 48 [2024-11-08 14:00:05,077 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 52 treesize of output 36 [2024-11-08 14:00:05,136 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 33 treesize of output 15 [2024-11-08 14:00:05,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 14:00:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:05,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:05,317 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 208 treesize of output 178 [2024-11-08 14:00:05,321 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 314 treesize of output 254 [2024-11-08 14:00:05,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse5 (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse6 (and (forall ((v_ArrVal_626 (Array Int Int)) (v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_626) v_arrayElimCell_36) v_arrayElimCell_37))) (forall ((v_ArrVal_626 (Array Int Int)) (v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (let ((.cse8 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_626) v_arrayElimCell_36))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 v_arrayElimCell_37)))))))) (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_626))) (or (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (let ((.cse0 (select .cse2 v_arrayElimCell_36))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 v_arrayElimCell_37))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 .cse3) .cse1))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_626))) (or (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse4 v_arrayElimCell_36) v_arrayElimCell_37))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse4 .cse3) .cse1))))) (or .cse5 .cse6) (or (forall ((v_ArrVal_629 Int)) (not (= v_ArrVal_629 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| v_ArrVal_629)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_626 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_626) .cse3) .cse1))) (not .cse5)) (or (forall ((v_ArrVal_629 Int)) (= v_ArrVal_629 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| v_ArrVal_629)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse6))))) is different from false [2024-11-08 14:00:05,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596813749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:05,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:05,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-08 14:00:05,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840999939] [2024-11-08 14:00:05,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:05,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 14:00:05,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:05,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 14:00:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=981, Unknown=1, NotChecked=62, Total=1122 [2024-11-08 14:00:05,805 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 30 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 14:00:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:06,568 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-11-08 14:00:06,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 14:00:06,568 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2024-11-08 14:00:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:06,569 INFO L225 Difference]: With dead ends: 38 [2024-11-08 14:00:06,569 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 14:00:06,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=154, Invalid=1919, Unknown=1, NotChecked=88, Total=2162 [2024-11-08 14:00:06,571 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:06,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 250 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 14:00:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 14:00:06,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-08 14:00:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:00:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-08 14:00:06,578 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 35 [2024-11-08 14:00:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:06,578 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-08 14:00:06,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 14:00:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-08 14:00:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 14:00:06,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:06,579 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:06,599 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-08 14:00:06,783 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-08 14:00:06,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:06,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:06,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1604539702, now seen corresponding path program 1 times [2024-11-08 14:00:06,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:06,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870175997] [2024-11-08 14:00:06,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:06,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:08,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:08,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870175997] [2024-11-08 14:00:08,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870175997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:08,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445870314] [2024-11-08 14:00:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:08,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:08,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:08,031 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-08 14:00:08,033 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-08 14:00:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:08,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-08 14:00:08,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:08,235 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-08 14:00:08,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 14:00:08,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 14:00:08,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-11-08 14:00:08,454 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 14:00:08,455 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 21 treesize of output 24 [2024-11-08 14:00:08,473 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 14:00:08,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 14:00:08,526 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 42 treesize of output 37 [2024-11-08 14:00:08,529 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 61 treesize of output 34 [2024-11-08 14:00:08,537 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 25 treesize of output 17 [2024-11-08 14:00:08,555 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-08 14:00:08,555 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-08 14:00:08,597 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 69 treesize of output 49 [2024-11-08 14:00:08,600 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 53 treesize of output 37 [2024-11-08 14:00:08,646 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 9 treesize of output 3 [2024-11-08 14:00:08,692 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 14:00:08,693 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 38 treesize of output 15 [2024-11-08 14:00:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:00:08,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:08,797 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 236 treesize of output 206 [2024-11-08 14:00:09,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:09,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 311 [2024-11-08 14:00:09,172 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-08 14:00:09,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-11-08 14:00:09,223 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-08 14:00:09,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-11-08 14:00:09,379 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-08 14:00:09,380 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-08 14:00:09,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445870314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:09,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:09,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2024-11-08 14:00:09,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995251031] [2024-11-08 14:00:09,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:09,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 14:00:09,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:09,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 14:00:09,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 14:00:09,740 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 22 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 14:00:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:10,505 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-08 14:00:10,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 14:00:10,506 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 22 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-11-08 14:00:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:10,506 INFO L225 Difference]: With dead ends: 39 [2024-11-08 14:00:10,506 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 14:00:10,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2024-11-08 14:00:10,508 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:10,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 374 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 14:00:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 14:00:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-08 14:00:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:00:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-08 14:00:10,515 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 37 [2024-11-08 14:00:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:10,516 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-08 14:00:10,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 22 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 14:00:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-08 14:00:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 14:00:10,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:10,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:10,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 14:00:10,717 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-08 14:00:10,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:10,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1604541376, now seen corresponding path program 1 times [2024-11-08 14:00:10,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:10,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356713810] [2024-11-08 14:00:10,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:12,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:12,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:12,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:12,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356713810] [2024-11-08 14:00:12,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356713810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:12,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306204836] [2024-11-08 14:00:12,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:12,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:12,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:12,651 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-08 14:00:12,652 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-08 14:00:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:12,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-08 14:00:12,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:12,862 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-08 14:00:12,873 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-08 14:00:12,944 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 11 [2024-11-08 14:00:13,156 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 14:00:13,156 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-08 14:00:13,169 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 16 treesize of output 11 [2024-11-08 14:00:13,229 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 20 treesize of output 15 [2024-11-08 14:00:13,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 14:00:13,235 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-08 14:00:13,441 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 45 treesize of output 21 [2024-11-08 14:00:13,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 14:00:13,452 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-08 14:00:13,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 14:00:13,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:13,675 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 53 treesize of output 36 [2024-11-08 14:00:13,686 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-08 14:00:13,687 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 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-08 14:00:13,713 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 14:00:13,713 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-08 14:00:13,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 14:00:13,820 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 77 treesize of output 56 [2024-11-08 14:00:13,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2024-11-08 14:00:13,834 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 107 treesize of output 64 [2024-11-08 14:00:13,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-08 14:00:13,867 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-08 14:00:13,867 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-08 14:00:13,960 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 155 treesize of output 115 [2024-11-08 14:00:13,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 87 [2024-11-08 14:00:14,142 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 14:00:14,142 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 88 treesize of output 33 [2024-11-08 14:00:14,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2024-11-08 14:00:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:14,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:14,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:14,876 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 200 [2024-11-08 14:00:14,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:14,882 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 173 [2024-11-08 14:00:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306204836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:15,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:15,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2024-11-08 14:00:15,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516517598] [2024-11-08 14:00:15,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:15,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-08 14:00:15,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:15,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-08 14:00:15,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2192, Unknown=34, NotChecked=0, Total=2352 [2024-11-08 14:00:15,007 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 42 states, 40 states have (on average 1.4) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:00:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:16,507 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-08 14:00:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 14:00:16,507 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.4) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-08 14:00:16,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:16,508 INFO L225 Difference]: With dead ends: 42 [2024-11-08 14:00:16,508 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 14:00:16,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=269, Invalid=4115, Unknown=38, NotChecked=0, Total=4422 [2024-11-08 14:00:16,510 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:16,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 412 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 14:00:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 14:00:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-08 14:00:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:00:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-08 14:00:16,520 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 37 [2024-11-08 14:00:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:16,521 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-08 14:00:16,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.4) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:00:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-08 14:00:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 14:00:16,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:16,522 INFO L215 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-08 14:00:16,542 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-08 14:00:16,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:16,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:16,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:16,723 INFO L85 PathProgramCache]: Analyzing trace with hash 71035409, now seen corresponding path program 2 times [2024-11-08 14:00:16,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:16,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912731536] [2024-11-08 14:00:16,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:16,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:16,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:16,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:16,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 14:00:16,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:16,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912731536] [2024-11-08 14:00:16,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912731536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:16,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101008522] [2024-11-08 14:00:16,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:00:16,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:16,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:16,903 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-08 14:00:16,904 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-08 14:00:17,091 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:00:17,091 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:17,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 14:00:17,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:00:17,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:00:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101008522] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:17,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:00:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2024-11-08 14:00:17,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976727079] [2024-11-08 14:00:17,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:17,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 14:00:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:17,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 14:00:17,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:00:17,208 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 14:00:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:17,276 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-08 14:00:17,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 14:00:17,277 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-08 14:00:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:17,277 INFO L225 Difference]: With dead ends: 45 [2024-11-08 14:00:17,277 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 14:00:17,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:00:17,278 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:17,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:00:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 14:00:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-11-08 14:00:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:00:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-08 14:00:17,289 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 39 [2024-11-08 14:00:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:17,290 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-08 14:00:17,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 14:00:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-08 14:00:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 14:00:17,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:17,291 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:17,309 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-08 14:00:17,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:17,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:17,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash 71037083, now seen corresponding path program 2 times [2024-11-08 14:00:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:17,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670080105] [2024-11-08 14:00:17,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:17,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:19,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:19,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670080105] [2024-11-08 14:00:19,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670080105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:19,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428463361] [2024-11-08 14:00:19,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:00:19,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:19,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:19,663 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-08 14:00:19,684 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-08 14:00:19,874 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:00:19,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:19,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-11-08 14:00:19,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:19,901 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-08 14:00:19,926 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-08 14:00:19,930 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-08 14:00:20,115 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 14:00:20,115 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-08 14:00:20,132 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 14:00:20,133 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-08 14:00:20,141 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 16 treesize of output 11 [2024-11-08 14:00:20,199 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-08 14:00:20,211 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-08 14:00:20,444 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 14:00:20,445 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-08 14:00:20,449 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-08 14:00:20,452 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-08 14:00:20,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:20,636 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 14:00:20,636 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-08 14:00:20,659 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-08 14:00:20,659 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-08 14:00:20,683 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 14:00:20,684 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-08 14:00:20,815 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 14:00:20,815 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 26 treesize of output 21 [2024-11-08 14:00:20,833 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-08 14:00:20,834 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 86 treesize of output 63 [2024-11-08 14:00:20,841 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 46 treesize of output 44 [2024-11-08 14:00:20,851 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 116 treesize of output 69 [2024-11-08 14:00:20,975 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 116 treesize of output 80 [2024-11-08 14:00:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:21,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:21,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:21,694 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 423 treesize of output 385 [2024-11-08 14:00:21,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:21,711 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 336 [2024-11-08 14:00:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428463361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:22,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:22,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2024-11-08 14:00:22,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943041432] [2024-11-08 14:00:22,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:22,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-08 14:00:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-08 14:00:22,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2318, Unknown=0, NotChecked=0, Total=2450 [2024-11-08 14:00:22,029 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 43 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 35 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 14:00:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:23,198 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-08 14:00:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 14:00:23,198 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 35 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2024-11-08 14:00:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:23,200 INFO L225 Difference]: With dead ends: 64 [2024-11-08 14:00:23,200 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 14:00:23,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=205, Invalid=3335, Unknown=0, NotChecked=0, Total=3540 [2024-11-08 14:00:23,202 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:23,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 424 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 14:00:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 14:00:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-08 14:00:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:00:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-11-08 14:00:23,211 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 39 [2024-11-08 14:00:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:23,211 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-08 14:00:23,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 35 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 14:00:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-11-08 14:00:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 14:00:23,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:23,212 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:23,226 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-08 14:00:23,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:23,413 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:23,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash -689037093, now seen corresponding path program 3 times [2024-11-08 14:00:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:23,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703727938] [2024-11-08 14:00:23,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:23,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:23,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 14:00:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:23,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:00:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 14:00:23,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:23,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703727938] [2024-11-08 14:00:23,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703727938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:23,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622882237] [2024-11-08 14:00:23,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:00:23,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:23,544 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-08 14:00:23,545 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-08 14:00:24,041 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 14:00:24,042 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:24,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 14:00:24,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 14:00:24,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:00:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622882237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:00:24,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-08 14:00:24,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306076368] [2024-11-08 14:00:24,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:24,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:00:24,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:24,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:00:24,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:00:24,074 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 14:00:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:24,089 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-11-08 14:00:24,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:00:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-11-08 14:00:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:24,090 INFO L225 Difference]: With dead ends: 46 [2024-11-08 14:00:24,090 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 14:00:24,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:00:24,091 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:24,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:24,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 14:00:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 14:00:24,092 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-08 14:00:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 14:00:24,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2024-11-08 14:00:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:24,092 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 14:00:24,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 14:00:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 14:00:24,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 14:00:24,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:00:24,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 14:00:24,295 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,SelfDestructingSolverStorable10 [2024-11-08 14:00:24,298 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2024-11-08 14:00:24,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 14:00:25,047 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:00:25,065 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,066 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,066 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,]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,068 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,068 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,069 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-08 14:00:25,069 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-08 14:00:25,069 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,069 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,073 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,073 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,073 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,073 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,073 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-08 14:00:25,074 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 14:00:25,074 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,074 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,074 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-08 14:00:25,074 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-08 14:00:25,074 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-08 14:00:25,074 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:25,074 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,074 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,075 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,]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,075 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,075 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,075 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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,075 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,076 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,076 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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,076 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,076 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,076 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-08 14:00:25,076 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,077 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,077 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,]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,079 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,079 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,079 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-08 14:00:25,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 14:00:25,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-08 14:00:25,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,081 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 14:00:25,081 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,081 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,081 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,081 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-08 14:00:25,081 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,082 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,082 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-08 14:00:25,082 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-08 14:00:25,082 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-08 14:00:25,082 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:25,082 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,083 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,]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 14:00:25,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,083 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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,084 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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,084 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-08 14:00:25,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,085 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,]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-08 14:00:25,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-08 14:00:25,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,087 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-08 14:00:25,087 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-08 14:00:25,087 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-08 14:00:25,087 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:25,087 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,087 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,087 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,]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,088 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,088 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,088 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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,088 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,088 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,088 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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,089 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,089 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,089 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-08 14:00:25,091 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-08 14:00:25,091 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 14:00:25,091 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,091 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,092 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-08 14:00:25,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 14:00:25,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 14:00:25,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 14:00:25,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-08 14:00:25,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 14:00:25,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:25,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 14:00:25,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 14:00:25,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 14:00:25,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 14:00:25,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,094 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-08 14:00:25,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 14:00:25,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 14:00:25,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 14:00:25,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-08 14:00:25,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:25,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:25,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 14:00:25,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 14:00:25,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 14:00:25,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 14:00:25,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:25,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:25,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 14:00:25,098 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-08 14:00:25,102 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int (Array Int Int)) (Array Int (Array Int Int)) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:280) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:355) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateProcedureContract(DefaultTranslator.java:379) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:338) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateProcedureContract(BacktranslationService.java:94) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-08 14:00:25,106 INFO L158 Benchmark]: Toolchain (without parser) took 38125.26ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 104.3MB in the beginning and 297.6MB in the end (delta: -193.3MB). Peak memory consumption was 225.8MB. Max. memory is 16.1GB. [2024-11-08 14:00:25,106 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:00:25,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.03ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 128.7MB in the end (delta: -24.5MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-08 14:00:25,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.83ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 127.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:00:25,107 INFO L158 Benchmark]: Boogie Preprocessor took 54.14ms. Allocated memory is still 167.8MB. Free memory was 127.2MB in the beginning and 123.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 14:00:25,107 INFO L158 Benchmark]: RCFGBuilder took 512.64ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 107.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 14:00:25,107 INFO L158 Benchmark]: TraceAbstraction took 36957.27ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 106.3MB in the beginning and 297.6MB in the end (delta: -191.2MB). Peak memory consumption was 229.6MB. Max. memory is 16.1GB. [2024-11-08 14:00:25,108 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.26ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.03ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 128.7MB in the end (delta: -24.5MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.83ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 127.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.14ms. Allocated memory is still 167.8MB. Free memory was 127.2MB in the beginning and 123.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 512.64ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 107.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 36957.27ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 106.3MB in the beginning and 297.6MB in the end (delta: -191.2MB). Peak memory consumption was 229.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,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$#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,]]]]],[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$#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,]]]]],[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$#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,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - 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$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,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$#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,]]]]],[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$#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,]]]]],[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$#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,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,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$#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,]]]]],[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$#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,]]]]],[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: ~head~0!offset - 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],[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!base - 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_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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: 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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~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_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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,]]] * 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: 629]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.1s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 2314 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2092 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3276 IncrementalHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 222 mSDtfsCounter, 3276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 345 SyntacticMatches, 3 SemanticMatches, 279 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1914 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 651 NumberOfCodeBlocks, 651 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 693 ConstructedInterpolants, 38 QuantifiedInterpolants, 8128 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 510 ConjunctsInUnsatCore, 21 InterpolantComputations, 4 PerfectInterpolantSequences, 281/444 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((data == 1) && (len == 2)) && (2 == count)) || (((count == 1) && (data == 1)) && (len == 2))) || (((count == 3) && (data == 1)) && (len == 2))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((2 == len) && (data == 1)) && (len == 2)) && (data == 1)) || ((((len <= 0) && (data == 1)) && (len == 2)) && (data == 1))) || ((((len == 1) && (data == 1)) && (len == 2)) && (data == 1))) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int (Array Int Int)) (Array Int (Array Int Int)) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int (Array Int Int)) (Array Int (Array Int Int)) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-08 14:00:25,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:00:27,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:00:27,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 14:00:27,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:00:27,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:00:27,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:00:27,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:00:27,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:00:27,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:00:27,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:00:27,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:00:27,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:00:27,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:00:27,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:00:27,382 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:00:27,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:00:27,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:00:27,384 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:00:27,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:00:27,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:00:27,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:00:27,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:00:27,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:00:27,386 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 14:00:27,386 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 14:00:27,387 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:00:27,387 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 14:00:27,387 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:00:27,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:00:27,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:00:27,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:00:27,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:00:27,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:00:27,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:00:27,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:00:27,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:00:27,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:00:27,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:00:27,391 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 14:00:27,391 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 14:00:27,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:00:27,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:00:27,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:00:27,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:00:27,393 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2024-11-08 14:00:27,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:00:27,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:00:27,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:00:27,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:00:27,750 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:00:27,752 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-08 14:00:29,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:00:29,600 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:00:29,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-11-08 14:00:29,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b19684a/f29866e9002b4d12b3018589f3940fda/FLAG385a67d39 [2024-11-08 14:00:29,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b19684a/f29866e9002b4d12b3018589f3940fda [2024-11-08 14:00:29,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:00:29,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:00:29,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:00:29,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:00:29,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:00:29,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:00:29" (1/1) ... [2024-11-08 14:00:29,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39571adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:29, skipping insertion in model container [2024-11-08 14:00:29,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:00:29" (1/1) ... [2024-11-08 14:00:29,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:00:30,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2024-11-08 14:00:30,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:00:30,086 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:00:30,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2024-11-08 14:00:30,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:00:30,184 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:00:30,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30 WrapperNode [2024-11-08 14:00:30,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:00:30,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:00:30,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:00:30,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:00:30,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,243 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2024-11-08 14:00:30,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:00:30,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:00:30,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:00:30,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:00:30,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,293 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 5, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-08 14:00:30,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:00:30,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:00:30,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:00:30,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:00:30,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (1/1) ... [2024-11-08 14:00:30,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:00:30,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:30,369 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-08 14:00:30,373 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-08 14:00:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 14:00:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 14:00:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 14:00:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 14:00:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 14:00:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 14:00:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:00:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 14:00:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 14:00:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 14:00:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 14:00:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 14:00:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 14:00:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 14:00:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 14:00:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 14:00:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 14:00:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 14:00:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 14:00:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 14:00:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 14:00:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 14:00:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 14:00:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 14:00:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:00:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:00:30,568 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:00:30,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:00:30,866 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-08 14:00:30,866 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:00:30,883 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:00:30,883 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 14:00:30,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:00:30 BoogieIcfgContainer [2024-11-08 14:00:30,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:00:30,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:00:30,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:00:30,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:00:30,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:00:29" (1/3) ... [2024-11-08 14:00:30,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2d70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:00:30, skipping insertion in model container [2024-11-08 14:00:30,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:30" (2/3) ... [2024-11-08 14:00:30,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2d70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:00:30, skipping insertion in model container [2024-11-08 14:00:30,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:00:30" (3/3) ... [2024-11-08 14:00:30,893 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2024-11-08 14:00:30,907 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:00:30,907 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:00:30,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:00:30,965 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;@76582e6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:00:30,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:00:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:00:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 14:00:30,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:30,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:30,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:30,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash 535821778, now seen corresponding path program 1 times [2024-11-08 14:00:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:00:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915666373] [2024-11-08 14:00:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:30,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:30,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:00:30,996 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 14:00:30,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 14:00:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:31,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 14:00:31,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:31,222 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-08 14:00:31,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:00:31,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:00:31,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915666373] [2024-11-08 14:00:31,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915666373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:31,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:31,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 14:00:31,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250447089] [2024-11-08 14:00:31,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:31,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 14:00:31,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:00:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 14:00:31,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:00:31,256 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-08 14:00:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:31,274 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2024-11-08 14:00:31,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 14:00:31,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 15 [2024-11-08 14:00:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:31,283 INFO L225 Difference]: With dead ends: 50 [2024-11-08 14:00:31,283 INFO L226 Difference]: Without dead ends: 22 [2024-11-08 14:00:31,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:00:31,289 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:31,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-08 14:00:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-08 14:00:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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-08 14:00:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-08 14:00:31,319 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-11-08 14:00:31,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:31,319 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-08 14:00:31,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-08 14:00:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-08 14:00:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 14:00:31,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:31,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:31,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 14:00:31,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:31,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:31,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1411921462, now seen corresponding path program 1 times [2024-11-08 14:00:31,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:00:31,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546001960] [2024-11-08 14:00:31,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:31,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:31,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:00:31,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 14:00:31,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 14:00:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:31,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 14:00:31,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:31,688 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-08 14:00:31,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:00:31,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:00:31,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546001960] [2024-11-08 14:00:31,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546001960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:31,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:31,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:00:31,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269397579] [2024-11-08 14:00:31,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:31,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:00:31,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:00:31,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:00:31,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:00:31,696 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-08 14:00:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:31,716 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-08 14:00:31,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:00:31,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2024-11-08 14:00:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:31,718 INFO L225 Difference]: With dead ends: 42 [2024-11-08 14:00:31,718 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 14:00:31,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:00:31,719 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:31,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 14:00:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-08 14:00:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-08 14:00:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-08 14:00:31,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2024-11-08 14:00:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:31,731 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-08 14:00:31,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-08 14:00:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-08 14:00:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 14:00:31,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:31,735 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:31,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 14:00:31,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:31,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:31,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:31,937 INFO L85 PathProgramCache]: Analyzing trace with hash 340179466, now seen corresponding path program 1 times [2024-11-08 14:00:31,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:00:31,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752231637] [2024-11-08 14:00:31,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:31,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:31,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:00:31,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 14:00:31,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 14:00:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:32,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 14:00:32,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:32,143 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-08 14:00:32,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:32,204 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-08 14:00:32,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:00:32,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752231637] [2024-11-08 14:00:32,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752231637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:32,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:32,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-08 14:00:32,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686210352] [2024-11-08 14:00:32,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:32,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:00:32,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:00:32,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:00:32,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:00:32,208 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 14:00:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:32,246 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-08 14:00:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:00:32,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-08 14:00:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:32,247 INFO L225 Difference]: With dead ends: 46 [2024-11-08 14:00:32,247 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 14:00:32,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:00:32,249 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:32,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 14:00:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-11-08 14:00:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-08 14:00:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-08 14:00:32,255 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 24 [2024-11-08 14:00:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:32,255 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-08 14:00:32,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 14:00:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-08 14:00:32,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 14:00:32,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:32,256 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:32,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 14:00:32,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:32,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:32,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:32,458 INFO L85 PathProgramCache]: Analyzing trace with hash 872550858, now seen corresponding path program 2 times [2024-11-08 14:00:32,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:00:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025949893] [2024-11-08 14:00:32,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:00:32,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:32,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:00:32,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 14:00:32,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 14:00:32,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 14:00:32,582 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:32,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 14:00:32,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:32,757 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-08 14:00:32,869 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 39 treesize of output 15 [2024-11-08 14:00:32,880 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-08 14:00:32,889 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 15 treesize of output 1 [2024-11-08 14:00:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 14:00:32,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:00:32,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:00:32,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025949893] [2024-11-08 14:00:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025949893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 14:00:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098259415] [2024-11-08 14:00:32,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:32,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 14:00:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:00:32,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 14:00:32,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:00:32,959 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:00:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:33,306 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-08 14:00:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 14:00:33,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-08 14:00:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:33,308 INFO L225 Difference]: With dead ends: 29 [2024-11-08 14:00:33,309 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 14:00:33,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:00:33,311 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:33,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 14:00:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 14:00:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 14:00:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-08 14:00:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-08 14:00:33,319 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2024-11-08 14:00:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:33,321 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-08 14:00:33,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:00:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-08 14:00:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 14:00:33,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:33,323 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:33,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 14:00:33,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:33,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:33,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1002784155, now seen corresponding path program 1 times [2024-11-08 14:00:33,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:00:33,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025675870] [2024-11-08 14:00:33,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:33,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:33,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:00:33,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 14:00:33,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 14:00:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:33,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 14:00:33,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:33,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-08 14:00:34,020 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-08 14:00:34,021 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 47 treesize of output 47 [2024-11-08 14:00:34,103 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-08 14:00:34,151 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 20 treesize of output 12 [2024-11-08 14:00:34,185 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 16 treesize of output 8 [2024-11-08 14:00:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:34,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:34,295 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 108 treesize of output 78 [2024-11-08 14:00:34,305 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 25 treesize of output 21 [2024-11-08 14:00:34,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:34,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 14:00:34,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:00:34,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025675870] [2024-11-08 14:00:34,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025675870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:34,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:34,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 17 [2024-11-08 14:00:34,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674166487] [2024-11-08 14:00:34,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:34,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 14:00:34,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:00:34,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 14:00:34,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-08 14:00:34,409 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 14:00:38,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 14:00:42,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 14:00:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:43,130 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-08 14:00:43,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:00:43,130 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-08 14:00:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:43,131 INFO L225 Difference]: With dead ends: 36 [2024-11-08 14:00:43,131 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 14:00:43,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-08 14:00:43,132 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:43,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 175 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-08 14:00:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 14:00:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 14:00:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:00:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-08 14:00:43,138 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 35 [2024-11-08 14:00:43,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:43,139 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-08 14:00:43,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 14:00:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-08 14:00:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 14:00:43,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:43,140 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:43,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 14:00:43,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:43,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:43,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1002785829, now seen corresponding path program 1 times [2024-11-08 14:00:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:00:43,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057080853] [2024-11-08 14:00:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:43,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:43,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:00:43,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 14:00:43,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 14:00:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:43,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-08 14:00:43,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:43,612 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 7 [2024-11-08 14:00:43,653 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-08 14:00:43,736 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 11 [2024-11-08 14:00:43,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-08 14:00:43,919 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 11 treesize of output 3 [2024-11-08 14:00:44,143 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 14:00:44,143 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 20 treesize of output 23 [2024-11-08 14:00:44,173 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-08 14:00:44,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-08 14:00:44,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 14:00:44,308 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 14:00:44,308 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 26 treesize of output 21 [2024-11-08 14:00:44,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-08 14:00:44,331 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 28 treesize of output 15 [2024-11-08 14:00:44,337 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 54 treesize of output 27 [2024-11-08 14:00:44,436 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 50 treesize of output 30 [2024-11-08 14:00:44,514 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 27 treesize of output 15 [2024-11-08 14:00:44,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 14:00:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:44,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:44,799 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 208 treesize of output 178 [2024-11-08 14:00:44,802 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 314 treesize of output 254 [2024-11-08 14:00:45,073 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (select .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse3 (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (.cse4 (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_304))) (or (= (select (select .cse10 .cse1) .cse2) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse10 v_arrayElimCell_21) v_arrayElimCell_22) |c_ULTIMATE.start_main_~data~0#1|))))) (.cse5 (and (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_304) v_arrayElimCell_21))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse2)) (= (select .cse9 v_arrayElimCell_22) |c_ULTIMATE.start_main_~data~0#1|)))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_304) v_arrayElimCell_21) v_arrayElimCell_22) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse0 (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (and (or (not .cse0) (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_304) .cse1) .cse2) |c_ULTIMATE.start_main_~data~0#1|)) (not .cse3)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) .cse4) (or .cse5 .cse3) (or .cse4 (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_304))) (or (= (select (select .cse6 .cse1) .cse2) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32))) (let ((.cse7 (select .cse6 v_arrayElimCell_21))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse2)) (= (select .cse7 v_arrayElimCell_22) |c_ULTIMATE.start_main_~data~0#1|))))))) (or .cse5 .cse0))))) is different from false [2024-11-08 14:00:45,369 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse2 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse5 (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse1 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (or (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_304) v_arrayElimCell_21))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 v_arrayElimCell_22))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_304) v_arrayElimCell_21) v_arrayElimCell_22)))))) .cse2) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_304) v_arrayElimCell_21))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 v_arrayElimCell_22))))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32)) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_304) .cse5) .cse1)))) (not .cse2)) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_304))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 .cse5) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 v_arrayElimCell_21) v_arrayElimCell_22))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (or (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32)) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_304))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 .cse5) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 v_arrayElimCell_21) v_arrayElimCell_22)))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_304) v_arrayElimCell_21) v_arrayElimCell_22))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_304))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse5) .cse1)) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32))) (let ((.cse9 (select .cse8 v_arrayElimCell_21))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 v_arrayElimCell_22)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|)))))))) is different from false [2024-11-08 14:00:45,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:00:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057080853] [2024-11-08 14:00:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057080853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2050920150] [2024-11-08 14:00:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:45,385 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 14:00:45,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 14:00:45,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 14:00:45,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-08 14:00:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:45,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-08 14:00:45,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:45,721 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 7 [2024-11-08 14:00:45,748 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-08 14:00:45,858 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 11 [2024-11-08 14:00:46,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-08 14:00:46,167 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 11 treesize of output 3 [2024-11-08 14:00:50,485 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-08 14:00:50,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-08 14:00:50,514 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 20 treesize of output 15 [2024-11-08 14:00:50,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 14:00:50,672 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 14:00:50,673 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 26 treesize of output 21 [2024-11-08 14:00:50,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-08 14:00:50,702 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 28 treesize of output 15 [2024-11-08 14:00:50,717 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 54 treesize of output 27 [2024-11-08 14:00:50,856 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 50 treesize of output 30 [2024-11-08 14:00:50,879 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 27 treesize of output 15 [2024-11-08 14:00:50,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 14:00:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:50,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:50,928 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 208 treesize of output 178 [2024-11-08 14:00:50,931 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 314 treesize of output 254 [2024-11-08 14:00:51,172 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse3 (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse5 (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse0 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_380))) (or (= (select (select .cse10 v_arrayElimCell_36) v_arrayElimCell_37) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 .cse2) .cse3)))))) (.cse7 (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_380) v_arrayElimCell_36))) (or (= (select .cse9 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse9 v_arrayElimCell_37) |c_ULTIMATE.start_main_~data~0#1|)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_380) v_arrayElimCell_36) v_arrayElimCell_37) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse6 (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|))) (and (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) .cse0) (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_380))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse1 .cse2) .cse3)) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (let ((.cse4 (select .cse1 v_arrayElimCell_36))) (or (= (select .cse4 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse4 v_arrayElimCell_37) |c_ULTIMATE.start_main_~data~0#1|))))))) (or (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_380) .cse2) .cse3))) (not .cse5) (not .cse6)) (or .cse5 .cse7) (or .cse0 (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or .cse7 .cse6))))) is different from false [2024-11-08 14:00:51,470 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse5 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse4 (select .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_380) v_arrayElimCell_36))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 v_arrayElimCell_37)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse2))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_380))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 .cse4) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 v_arrayElimCell_36) v_arrayElimCell_37))))))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32)) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_380) .cse4) .cse2)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)))) (not .cse5)) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32)) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_380))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 .cse4) .cse2)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 v_arrayElimCell_36) v_arrayElimCell_37))))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_380) v_arrayElimCell_36))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 v_arrayElimCell_37)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse2))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_380) v_arrayElimCell_36) v_arrayElimCell_37))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)))))) .cse5) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_380))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse4) .cse2)) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (let ((.cse9 (select .cse8 v_arrayElimCell_36))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 v_arrayElimCell_37)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse2)))))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_380) v_arrayElimCell_36) v_arrayElimCell_37))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)))))) is different from false [2024-11-08 14:00:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2050920150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:51,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:51,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2024-11-08 14:00:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595975928] [2024-11-08 14:00:51,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:51,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 14:00:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:00:51,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 14:00:51,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=859, Unknown=5, NotChecked=244, Total=1190 [2024-11-08 14:00:51,512 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 27 states, 25 states have (on average 1.72) internal successors, (43), 21 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 14:00:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:53,068 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-11-08 14:00:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 14:00:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.72) internal successors, (43), 21 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2024-11-08 14:00:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:53,070 INFO L225 Difference]: With dead ends: 38 [2024-11-08 14:00:53,070 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 14:00:53,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=131, Invalid=1362, Unknown=5, NotChecked=308, Total=1806 [2024-11-08 14:00:53,072 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:53,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 227 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 14:00:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 14:00:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-08 14:00:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:00:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-08 14:00:53,080 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 35 [2024-11-08 14:00:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:53,080 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-08 14:00:53,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.72) internal successors, (43), 21 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 14:00:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-08 14:00:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 14:00:53,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:53,081 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:53,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 14:00:53,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-08 14:00:53,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 14:00:53,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:53,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1604539702, now seen corresponding path program 1 times [2024-11-08 14:00:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:00:53,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328262960] [2024-11-08 14:00:53,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:53,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 14:00:53,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:00:53,487 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 14:00:53,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 14:00:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:53,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-08 14:00:53,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:53,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 14:00:53,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-11-08 14:00:54,122 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 14:00:54,123 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 21 treesize of output 24 [2024-11-08 14:00:54,265 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2024-11-08 14:00:54,266 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 48 treesize of output 55 [2024-11-08 14:00:54,270 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 70 treesize of output 39 [2024-11-08 14:00:54,304 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 14:00:54,304 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 26 treesize of output 21 [2024-11-08 14:00:54,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 14:00:54,419 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 51 treesize of output 31 [2024-11-08 14:00:54,516 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 7 treesize of output 3 [2024-11-08 14:00:54,694 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2024-11-08 14:00:54,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 69 [2024-11-08 14:00:54,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:54,726 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 50 [2024-11-08 14:00:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:00:55,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:55,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:55,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2024-11-08 14:00:55,356 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 431 treesize of output 371 [2024-11-08 14:00:56,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:56,871 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 105 [2024-11-08 14:00:57,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:57,105 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2024-11-08 14:00:57,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:57,308 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2024-11-08 14:00:57,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:57,345 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2024-11-08 14:00:57,459 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse5 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse20 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) .cse6)) (.cse17 (not .cse5)) (.cse2 (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse16 (bvadd .cse19 (_ bv4 32)))) (and (or (forall ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_1))) (let ((.cse0 (select (select .cse3 .cse1) .cse4))) (or (= .cse0 .cse1) (not (= (select v_arrayElimArr_1 (_ bv4 32)) .cse2)) (not (= (_ bv0 32) (select (select .cse3 .cse0) (bvadd (_ bv4 32) v_arrayElimCell_55)))))))) .cse5) (or (forall ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_2 (_ bv4 32)) .cse2)) (= v_arrayElimCell_55 .cse6) (not (= (_ bv0 32) (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_2))) (select .cse7 (select (select .cse7 .cse1) .cse4))) (bvadd (_ bv4 32) v_arrayElimCell_55)))))) .cse5) (forall ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_1 (_ bv4 32)) .cse2)) (forall ((v_arrayElimCell_55 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_1))) (let ((.cse8 (select (select .cse10 .cse1) .cse4))) (or (= .cse8 .cse1) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse10 .cse8) (bvadd (_ bv4 32) v_arrayElimCell_55)))))))))) (forall ((v_arrayElimCell_55 (_ BitVec 32))) (or (= v_arrayElimCell_55 .cse6) (forall ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_2 (_ bv4 32)) .cse2)) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (_ bv0 32) (select (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_2))) (select .cse11 (select (select .cse11 .cse1) .cse4))) (bvadd (_ bv4 32) v_arrayElimCell_55)))))))))) (or (and (or .cse5 (forall ((v_arrayElimCell_55 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32)) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_4))) (select .cse12 (select (select .cse12 .cse1) .cse4))) (bvadd (_ bv4 32) v_arrayElimCell_55)))) (not (= (select v_arrayElimArr_4 (_ bv4 32)) .cse2))))) (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_4))) (select .cse13 (select (select .cse13 .cse1) .cse4))) (bvadd (_ bv4 32) v_arrayElimCell_55)))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (select v_arrayElimArr_4 (_ bv4 32)) .cse2)))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select v_arrayElimArr_3 (_ bv4 32)) .cse2)) (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| .cse14)) (not (= (_ bv0 32) (select (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_3))) (select .cse15 (select (select .cse15 .cse14) (_ bv4 32)))) .cse16)))))) .cse17)) (not (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_main_~uneq~0#1|))) (or .cse17 (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_ArrVal_463) .cse2) .cse16))) (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| .cse18)) (= .cse18 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (store v_ArrVal_463 (_ bv4 32) .cse2)) .cse18) (_ bv4 32))))))) (or .cse17 (= .cse19 (_ bv0 32)) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_ArrVal_463) .cse2) .cse16))) (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2024-11-08 14:00:57,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:00:57,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328262960] [2024-11-08 14:00:57,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328262960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:57,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1393116470] [2024-11-08 14:00:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:57,808 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 14:00:57,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 14:00:57,810 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 14:00:57,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-08 14:00:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:58,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 14:00:58,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:58,144 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 7 [2024-11-08 14:00:58,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 14:00:58,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-11-08 14:00:58,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-08 14:00:58,838 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 14:00:58,838 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 21 treesize of output 24 [2024-11-08 14:00:58,861 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-08 14:00:58,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-08 14:00:58,977 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 14:00:58,978 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 26 treesize of output 21 [2024-11-08 14:00:58,986 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 36 treesize of output 31 [2024-11-08 14:00:58,989 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 55 treesize of output 28 [2024-11-08 14:00:58,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 14:00:59,093 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 51 treesize of output 31 [2024-11-08 14:00:59,161 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 7 treesize of output 3 [2024-11-08 14:00:59,237 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 14:00:59,237 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 32 treesize of output 15 [2024-11-08 14:00:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:00:59,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:59,539 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 236 treesize of output 206 [2024-11-08 14:01:00,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:01:00,434 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 159 [2024-11-08 14:01:00,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse4 (select .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse5 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|) (_ bv0 1))) (not (= (_ bv0 32) (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| v_arrayElimArr_5))) (select .cse1 (select (select .cse1 .cse2) .cse3))) (bvadd (_ bv4 32) v_arrayElimCell_69)))))) (not (= (select v_arrayElimArr_5 (_ bv4 32)) .cse4)))) (or (not .cse5) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| .cse6)) (not (= (_ bv0 32) (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| v_arrayElimArr_5))) (select .cse7 (select (select .cse7 .cse6) (_ bv4 32)))) (bvadd (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (_ bv4 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|) (_ bv0 1))) (not (= (select v_arrayElimArr_5 (_ bv4 32)) .cse4)))))) (or (forall ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|) (_ bv0 1))) (not (= (_ bv0 32) (select (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| v_arrayElimArr_5))) (select .cse9 (select (select .cse9 .cse2) .cse3))) (bvadd (_ bv4 32) v_arrayElimCell_69)))) (not (= (select v_arrayElimArr_5 (_ bv4 32)) .cse4)))) .cse5)))) is different from false [2024-11-08 14:01:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1393116470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:01:00,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:01:00,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2024-11-08 14:01:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798399855] [2024-11-08 14:01:00,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:01:00,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-08 14:01:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:01:00,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 14:01:00,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2114, Unknown=2, NotChecked=186, Total=2450 [2024-11-08 14:01:00,734 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 39 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 31 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:01:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:01:03,536 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-11-08 14:01:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 14:01:03,537 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 31 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-08 14:01:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:01:03,539 INFO L225 Difference]: With dead ends: 41 [2024-11-08 14:01:03,539 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 14:01:03,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=309, Invalid=3987, Unknown=2, NotChecked=258, Total=4556 [2024-11-08 14:01:03,542 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 14:01:03,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 443 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 14:01:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 14:01:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-08 14:01:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:01:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-08 14:01:03,550 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 37 [2024-11-08 14:01:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:01:03,551 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-08 14:01:03,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 31 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:01:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-08 14:01:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 14:01:03,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:01:03,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:01:03,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-08 14:01:03,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0