./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_insert_equal.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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:10:24,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:10:24,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:10:24,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:10:24,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:10:24,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:10:24,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:10:24,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:10:24,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:10:24,763 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:10:24,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:10:24,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:10:24,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:10:24,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:10:24,768 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:10:24,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:10:24,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:10:24,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:10:24,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:10:24,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:10:24,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:10:24,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:10:24,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:10:24,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:10:24,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:10:24,774 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:10:24,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:10:24,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:10:24,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:10:24,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:10:24,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:10:24,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:10:24,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:10:24,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:10:24,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:10:24,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:10:24,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:10:24,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:10:24,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:10:24,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:10:24,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:10:24,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:10:24,779 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2024-11-18 13:10:25,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:10:25,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:10:25,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:10:25,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:10:25,033 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:10:25,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-11-18 13:10:26,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:10:26,703 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:10:26,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-11-18 13:10:26,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e91bcdc5e/51ce3d42e7334698b4bfa7aebc2b1a39/FLAGf202c97b8 [2024-11-18 13:10:26,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e91bcdc5e/51ce3d42e7334698b4bfa7aebc2b1a39 [2024-11-18 13:10:26,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:10:26,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:10:26,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:10:26,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:10:26,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:10:26,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:10:26" (1/1) ... [2024-11-18 13:10:26,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee60e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:26, skipping insertion in model container [2024-11-18 13:10:26,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:10:26" (1/1) ... [2024-11-18 13:10:26,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:10:27,101 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_insert_equal.i[24301,24314] [2024-11-18 13:10:27,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:10:27,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:10:27,163 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_insert_equal.i[24301,24314] [2024-11-18 13:10:27,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:10:27,205 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:10:27,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27 WrapperNode [2024-11-18 13:10:27,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:10:27,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:10:27,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:10:27,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:10:27,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,259 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2024-11-18 13:10:27,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:10:27,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:10:27,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:10:27,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:10:27,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,294 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 6 writes are split as follows [0, 5, 1]. [2024-11-18 13:10:27,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:10:27,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:10:27,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:10:27,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:10:27,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (1/1) ... [2024-11-18 13:10:27,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:10:27,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:27,370 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-18 13:10:27,377 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-18 13:10:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:10:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:10:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 13:10:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:10:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:10:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 13:10:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-18 13:10:27,439 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-18 13:10:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:10:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:10:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 13:10:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:10:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:10:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 13:10:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:10:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:10:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 13:10:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:10:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 13:10:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 13:10:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 13:10:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:10:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:10:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 13:10:27,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:10:27,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:10:27,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:10:27,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:10:27,797 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-18 13:10:27,797 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:10:27,813 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:10:27,813 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 13:10:27,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:10:27 BoogieIcfgContainer [2024-11-18 13:10:27,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:10:27,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:10:27,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:10:27,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:10:27,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:10:26" (1/3) ... [2024-11-18 13:10:27,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b679a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:10:27, skipping insertion in model container [2024-11-18 13:10:27,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:27" (2/3) ... [2024-11-18 13:10:27,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b679a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:10:27, skipping insertion in model container [2024-11-18 13:10:27,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:10:27" (3/3) ... [2024-11-18 13:10:27,822 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2024-11-18 13:10:27,837 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:10:27,837 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:10:27,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:10:27,887 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;@4820c97e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:10:27,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:10:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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-18 13:10:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-18 13:10:27,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:27,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:10:27,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:27,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2024-11-18 13:10:27,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:27,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840572858] [2024-11-18 13:10:27,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:27,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:28,117 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-18 13:10:28,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840572858] [2024-11-18 13:10:28,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840572858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:10:28,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:10:28,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:10:28,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104750395] [2024-11-18 13:10:28,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:10:28,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:10:28,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:28,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:10:28,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:10:28,151 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-18 13:10:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:28,166 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2024-11-18 13:10:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:10:28,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 19 [2024-11-18 13:10:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:28,172 INFO L225 Difference]: With dead ends: 54 [2024-11-18 13:10:28,172 INFO L226 Difference]: Without dead ends: 24 [2024-11-18 13:10:28,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:10:28,177 INFO L432 NwaCegarLoop]: 37 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, 37 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-18 13:10:28,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:10:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-18 13:10:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-18 13:10:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-18 13:10:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-18 13:10:28,228 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2024-11-18 13:10:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:28,228 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-18 13:10:28,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-18 13:10:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-11-18 13:10:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-18 13:10:28,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:28,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:10:28,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:10:28,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:28,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2024-11-18 13:10:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:28,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443255100] [2024-11-18 13:10:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:28,495 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-18 13:10:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443255100] [2024-11-18 13:10:28,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443255100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:10:28,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:10:28,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:10:28,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273947483] [2024-11-18 13:10:28,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:10:28,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:10:28,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:28,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:10:28,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:10:28,503 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-18 13:10:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:28,532 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-11-18 13:10:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:10:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2024-11-18 13:10:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:28,537 INFO L225 Difference]: With dead ends: 46 [2024-11-18 13:10:28,538 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 13:10:28,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:10:28,540 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 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-18 13:10:28,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:10:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 13:10:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-11-18 13:10:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-18 13:10:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-18 13:10:28,552 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2024-11-18 13:10:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:28,553 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-18 13:10:28,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-18 13:10:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-18 13:10:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-18 13:10:28,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:28,555 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:10:28,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:10:28,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:28,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2024-11-18 13:10:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:28,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064026367] [2024-11-18 13:10:28,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:28,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:28,807 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-18 13:10:28,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:28,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064026367] [2024-11-18 13:10:28,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064026367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:28,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123229074] [2024-11-18 13:10:28,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:28,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:28,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:28,811 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-18 13:10:28,814 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-18 13:10:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:29,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 13:10:29,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:29,079 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-18 13:10:29,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:29,131 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-18 13:10:29,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123229074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:10:29,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:10:29,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-18 13:10:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904708491] [2024-11-18 13:10:29,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:29,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:10:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:29,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:10:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:10:29,134 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-18 13:10:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:29,164 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-11-18 13:10:29,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:10:29,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2024-11-18 13:10:29,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:29,165 INFO L225 Difference]: With dead ends: 47 [2024-11-18 13:10:29,166 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 13:10:29,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:10:29,167 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:29,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:10:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 13:10:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-18 13:10:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:10:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-18 13:10:29,177 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2024-11-18 13:10:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:29,178 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-18 13:10:29,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-18 13:10:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-18 13:10:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 13:10:29,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:29,180 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-18 13:10:29,197 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-18 13:10:29,381 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-18 13:10:29,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:29,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash -941011836, now seen corresponding path program 2 times [2024-11-18 13:10:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110547938] [2024-11-18 13:10:29,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:10:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:29,422 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-18 13:10:29,422 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:10:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 13:10:29,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:29,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110547938] [2024-11-18 13:10:29,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110547938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:10:29,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:10:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:10:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515856876] [2024-11-18 13:10:29,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:10:29,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:10:29,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:10:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:10:29,460 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 13:10:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:29,477 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-11-18 13:10:29,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:10:29,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-18 13:10:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:29,479 INFO L225 Difference]: With dead ends: 38 [2024-11-18 13:10:29,480 INFO L226 Difference]: Without dead ends: 31 [2024-11-18 13:10:29,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:10:29,481 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 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-18 13:10:29,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:10:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-18 13:10:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-18 13:10:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:10:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-18 13:10:29,491 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 37 [2024-11-18 13:10:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:29,492 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-18 13:10:29,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 13:10:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-18 13:10:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 13:10:29,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:29,494 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-18 13:10:29,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 13:10:29,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:29,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 1 times [2024-11-18 13:10:29,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:29,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578729277] [2024-11-18 13:10:29,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 13:10:29,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:29,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578729277] [2024-11-18 13:10:29,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578729277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:10:29,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:10:29,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:10:29,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803099246] [2024-11-18 13:10:29,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:10:29,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:10:29,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:29,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:10:29,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:10:29,700 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-18 13:10:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:29,724 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-18 13:10:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:10:29,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-18 13:10:29,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:29,727 INFO L225 Difference]: With dead ends: 40 [2024-11-18 13:10:29,727 INFO L226 Difference]: Without dead ends: 32 [2024-11-18 13:10:29,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:10:29,728 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 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-18 13:10:29,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:10:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-18 13:10:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-18 13:10:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-18 13:10:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-18 13:10:29,738 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 37 [2024-11-18 13:10:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:29,738 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-18 13:10:29,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-18 13:10:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-18 13:10:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 13:10:29,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:29,743 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, 1] [2024-11-18 13:10:29,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 13:10:29,743 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:29,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2024-11-18 13:10:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:29,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083586706] [2024-11-18 13:10:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:29,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-18 13:10:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083586706] [2024-11-18 13:10:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083586706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137910267] [2024-11-18 13:10:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:29,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:29,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:29,951 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-18 13:10:29,953 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-18 13:10:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:30,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 13:10:30,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:30,257 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-18 13:10:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 13:10:30,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-18 13:10:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137910267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:10:30,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:10:30,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2024-11-18 13:10:30,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972279995] [2024-11-18 13:10:30,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:30,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 13:10:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:30,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 13:10:30,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-18 13:10:30,326 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 13:10:34,346 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-18 13:10:38,363 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-18 13:10:42,390 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-18 13:10:46,461 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-18 13:10:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:46,493 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-18 13:10:46,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 13:10:46,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-18 13:10:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:46,495 INFO L225 Difference]: With dead ends: 46 [2024-11-18 13:10:46,495 INFO L226 Difference]: Without dead ends: 43 [2024-11-18 13:10:46,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-18 13:10:46,496 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:46,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 186 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-11-18 13:10:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-18 13:10:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2024-11-18 13:10:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-18 13:10:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-18 13:10:46,502 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 38 [2024-11-18 13:10:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:46,502 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-18 13:10:46,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 13:10:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-18 13:10:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 13:10:46,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:46,504 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, 1] [2024-11-18 13:10:46,522 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-18 13:10:46,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 13:10:46,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:46,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1457379225, now seen corresponding path program 1 times [2024-11-18 13:10:46,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:46,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997464413] [2024-11-18 13:10:46,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:10:48,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:48,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997464413] [2024-11-18 13:10:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997464413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:48,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691788758] [2024-11-18 13:10:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:48,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:48,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:48,145 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-18 13:10:48,146 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-18 13:10:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:48,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-18 13:10:48,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:48,433 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-18 13:10:48,452 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-18 13:10:48,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 23 treesize of output 11 [2024-11-18 13:10:48,735 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-18 13:10:48,739 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-18 13:10:48,937 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:10:48,938 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-18 13:10:48,973 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:10:48,973 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-18 13:10:49,245 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 39 treesize of output 15 [2024-11-18 13:10:49,320 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-18 13:10:49,389 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 19 treesize of output 11 [2024-11-18 13:10:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:10:49,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:49,478 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_522) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-18 13:10:51,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_521 Int) (v_ArrVal_522 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) v_ArrVal_521)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_522) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-18 13:10:53,333 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_521 Int) (v_ArrVal_522 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (+ 4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) v_ArrVal_521))) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_522) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-18 13:10:53,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691788758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:53,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:53,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2024-11-18 13:10:53,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722103759] [2024-11-18 13:10:53,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:53,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-18 13:10:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:53,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-18 13:10:53,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1133, Unknown=24, NotChecked=210, Total=1482 [2024-11-18 13:10:53,454 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 34 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 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-18 13:10:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:54,240 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-11-18 13:10:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 13:10:54,240 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 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 38 [2024-11-18 13:10:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:54,242 INFO L225 Difference]: With dead ends: 51 [2024-11-18 13:10:54,242 INFO L226 Difference]: Without dead ends: 49 [2024-11-18 13:10:54,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=165, Invalid=1803, Unknown=24, NotChecked=264, Total=2256 [2024-11-18 13:10:54,247 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:54,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 352 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 13:10:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-18 13:10:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2024-11-18 13:10:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 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-18 13:10:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-18 13:10:54,259 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 38 [2024-11-18 13:10:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:54,260 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-18 13:10:54,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 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-18 13:10:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-18 13:10:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 13:10:54,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:54,264 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, 1] [2024-11-18 13:10:54,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 13:10:54,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:54,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:54,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1514635853, now seen corresponding path program 1 times [2024-11-18 13:10:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:54,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681617451] [2024-11-18 13:10:54,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:54,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:10:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681617451] [2024-11-18 13:10:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681617451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415611094] [2024-11-18 13:10:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:55,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:55,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:55,037 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-18 13:10:55,039 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-18 13:10:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:55,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-18 13:10:55,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:55,194 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-18 13:10:55,240 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-18 13:10:55,264 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:10:55,265 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-18 13:10:55,364 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 3 [2024-11-18 13:10:55,379 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-18 13:10:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:10:55,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415611094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:55,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:55,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2024-11-18 13:10:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985563129] [2024-11-18 13:10:55,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:55,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-18 13:10:55,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:55,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-18 13:10:55,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-11-18 13:10:55,525 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 13:10:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:55,731 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-18 13:10:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 13:10:55,732 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-18 13:10:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:55,732 INFO L225 Difference]: With dead ends: 55 [2024-11-18 13:10:55,732 INFO L226 Difference]: Without dead ends: 52 [2024-11-18 13:10:55,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2024-11-18 13:10:55,733 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:55,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 300 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:10:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-18 13:10:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-11-18 13:10:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 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-18 13:10:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-18 13:10:55,747 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 38 [2024-11-18 13:10:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:55,747 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-18 13:10:55,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 13:10:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-18 13:10:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 13:10:55,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:55,749 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, 1] [2024-11-18 13:10:55,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 13:10:55,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:55,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:55,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1514637527, now seen corresponding path program 1 times [2024-11-18 13:10:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:55,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245336052] [2024-11-18 13:10:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:55,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 13:10:56,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:56,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245336052] [2024-11-18 13:10:56,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245336052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:56,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188309055] [2024-11-18 13:10:56,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:56,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:56,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:56,210 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-18 13:10:56,212 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-18 13:10:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:56,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 13:10:56,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:56,448 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-18 13:10:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:10:56,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 13:10:56,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188309055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:10:56,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:10:56,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 14 [2024-11-18 13:10:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319187115] [2024-11-18 13:10:56,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:56,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 13:10:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 13:10:56,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-18 13:10:56,525 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:11:00,552 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-18 13:11:04,562 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-18 13:11:08,581 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-18 13:11:12,684 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-18 13:11:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:11:12,695 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-11-18 13:11:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 13:11:12,695 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-11-18 13:11:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:11:12,696 INFO L225 Difference]: With dead ends: 57 [2024-11-18 13:11:12,696 INFO L226 Difference]: Without dead ends: 49 [2024-11-18 13:11:12,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-18 13:11:12,697 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:11:12,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 257 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-11-18 13:11:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-18 13:11:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2024-11-18 13:11:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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-18 13:11:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-18 13:11:12,704 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 38 [2024-11-18 13:11:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:11:12,704 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-18 13:11:12,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:11:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-18 13:11:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-18 13:11:12,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:11:12,705 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, 1, 1] [2024-11-18 13:11:12,723 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-18 13:11:12,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:11:12,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:11:12,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:11:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1501961106, now seen corresponding path program 2 times [2024-11-18 13:11:12,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:11:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315169815] [2024-11-18 13:11:12,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:11:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:11:12,941 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:11:12,941 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:11:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 13:11:13,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:11:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315169815] [2024-11-18 13:11:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315169815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:11:13,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:11:13,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:11:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061772259] [2024-11-18 13:11:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:11:13,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:11:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:11:13,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:11:13,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:11:13,040 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-18 13:11:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:11:13,064 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-11-18 13:11:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:11:13,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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) Word has length 39 [2024-11-18 13:11:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:11:13,066 INFO L225 Difference]: With dead ends: 51 [2024-11-18 13:11:13,067 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 13:11:13,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 13:11:13,068 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:11:13,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:11:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 13:11:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-18 13:11:13,076 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-18 13:11:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-18 13:11:13,077 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 39 [2024-11-18 13:11:13,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:11:13,079 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-18 13:11:13,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-18 13:11:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-18 13:11:13,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 13:11:13,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:11:13,080 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, 1, 1, 1] [2024-11-18 13:11:13,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 13:11:13,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:11:13,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:11:13,081 INFO L85 PathProgramCache]: Analyzing trace with hash 382129514, now seen corresponding path program 1 times [2024-11-18 13:11:13,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:11:13,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734733818] [2024-11-18 13:11:13,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:11:13,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:11:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:11:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:11:14,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:11:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734733818] [2024-11-18 13:11:14,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734733818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:11:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348137165] [2024-11-18 13:11:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:11:14,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:11:14,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:11:14,037 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-18 13:11:14,038 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-18 13:11:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:11:14,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-18 13:11:14,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:11:14,271 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-18 13:11:14,314 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-18 13:11:14,425 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-18 13:11:14,428 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-18 13:11:14,563 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:11:14,564 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 21 treesize of output 24 [2024-11-18 13:11:14,578 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:11:14,578 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-18 13:11:14,727 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-18 13:11:14,727 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 1 case distinctions, treesize of input 26 treesize of output 37 [2024-11-18 13:11:14,824 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-18 13:11:14,824 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 63 [2024-11-18 13:11:14,830 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 21 treesize of output 13 [2024-11-18 13:11:14,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 20 treesize of output 12 [2024-11-18 13:11:14,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-18 13:11:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 13:11:14,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:11:14,944 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_968 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_968) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2024-11-18 13:11:15,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348137165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:11:15,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:11:15,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 34 [2024-11-18 13:11:15,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048878640] [2024-11-18 13:11:15,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:11:15,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-18 13:11:15,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:11:15,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-18 13:11:15,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1356, Unknown=19, NotChecked=74, Total=1560 [2024-11-18 13:11:15,189 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 34 states, 32 states have (on average 1.75) internal successors, (56), 27 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-18 13:11:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:11:15,824 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-18 13:11:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-18 13:11:15,825 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.75) internal successors, (56), 27 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2024-11-18 13:11:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:11:15,826 INFO L225 Difference]: With dead ends: 42 [2024-11-18 13:11:15,827 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 13:11:15,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=2643, Unknown=19, NotChecked=104, Total=2970 [2024-11-18 13:11:15,828 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:11:15,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 373 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 13:11:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 13:11:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-18 13:11:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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-18 13:11:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-18 13:11:15,834 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 40 [2024-11-18 13:11:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:11:15,835 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-18 13:11:15,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.75) internal successors, (56), 27 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-18 13:11:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-18 13:11:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 13:11:15,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:11:15,836 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, 1, 1, 1] [2024-11-18 13:11:15,852 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-18 13:11:16,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:11:16,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:11:16,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:11:16,037 INFO L85 PathProgramCache]: Analyzing trace with hash 382131188, now seen corresponding path program 1 times [2024-11-18 13:11:16,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:11:16,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704096333] [2024-11-18 13:11:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:11:16,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:11:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:11:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:11:17,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:11:17,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704096333] [2024-11-18 13:11:17,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704096333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:11:17,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381138278] [2024-11-18 13:11:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:11:17,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:11:17,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:11:17,200 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-18 13:11:17,201 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-18 13:11:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:11:17,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-18 13:11:17,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:11:17,673 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-18 13:11:17,744 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-18 13:11:17,935 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-18 13:11:17,939 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-18 13:11:18,090 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-18 13:11:18,192 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:11:18,192 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-18 13:11:18,213 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:11:18,213 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-18 13:11:18,513 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 31 treesize of output 15 [2024-11-18 13:11:18,520 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 24 treesize of output 11 [2024-11-18 13:11:18,528 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 19 treesize of output 11 [2024-11-18 13:11:18,640 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-18 13:11:18,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2024-11-18 13:11:18,645 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 15 [2024-11-18 13:11:18,653 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 55 treesize of output 19 [2024-11-18 13:11:18,739 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-18 13:11:18,788 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-18 13:11:18,790 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-18 13:11:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:11:18,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:11:19,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1106) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse0) .cse1)))) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1107 .cse2))) v_ArrVal_1107)))) is different from false [2024-11-18 13:11:19,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:11:19,032 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 68 [2024-11-18 13:11:19,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:11:19,043 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 130 treesize of output 129 [2024-11-18 13:11:19,050 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 56 treesize of output 48 [2024-11-18 13:11:19,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (.cse8 (+ .cse0 4)) (.cse5 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse9 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse7))) (let ((.cse1 (or (forall ((v_ArrVal_1107 (Array Int Int)) (v_arrayElimCell_41 Int) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1103))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107) v_arrayElimCell_41) (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse7) .cse8))) (not (= v_ArrVal_1107 (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1107 .cse5))))))) .cse9)) (.cse3 (not .cse9)) (.cse2 (forall ((v_arrayElimCell_41 Int) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1103))) (or (forall ((v_ArrVal_1105 (Array Int Int))) (let ((.cse12 (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107)) (.cse13 (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse7) .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_41) .cse13)) (forall ((v_arrayElimCell_43 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_43) .cse13)))))) (not (= v_ArrVal_1107 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1107 .cse5))))))))) (and (or (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| .cse0) (and .cse1 .cse2)) (or .cse3 (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1103))) (or (not (= v_ArrVal_1107 (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1107 .cse5)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107) v_arrayElimCell_43) (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse7) .cse8))))))) (or (forall ((v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1103) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 v_DerPreprocessor_1) (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse7) .cse8)))) .cse9) (or (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse7) (and .cse1 (or .cse3 (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_arrayElimCell_43 Int)) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1107 .cse5)) v_ArrVal_1107)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1103) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107) v_arrayElimCell_43) (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse7) .cse8)))))) .cse2)) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1103))) (or (forall ((v_ArrVal_1105 (Array Int Int))) (let ((.cse11 (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse7) .cse8))) (or (forall ((v_arrayElimCell_43 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107) v_arrayElimCell_43) .cse11))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1107 .cse11))))) (not (= v_ArrVal_1107 (store (select .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1107 .cse5))))))))))) is different from false [2024-11-18 13:11:19,514 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (.cse4 (+ .cse8 4)) (.cse11 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse3))) (let ((.cse6 (or (forall ((v_ArrVal_1107 (Array Int Int)) (v_arrayElimCell_41 Int) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1103))) (or (not (= v_ArrVal_1107 (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1107 .cse1)))) (= (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107) v_arrayElimCell_41) (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse3) .cse4)) |c_ULTIMATE.start_main_~data~0#1|)))) .cse11)) (.cse5 (not .cse11)) (.cse7 (forall ((v_arrayElimCell_41 Int) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1103))) (or (forall ((v_ArrVal_1105 (Array Int Int))) (let ((.cse12 (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107)) (.cse13 (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse3) .cse4))) (or (= (select (select .cse12 v_arrayElimCell_41) .cse13) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_43 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_43) .cse13)))))) (not (= v_ArrVal_1107 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1107 .cse1))))))))) (and (or (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1103))) (or (not (= v_ArrVal_1107 (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1107 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107) v_arrayElimCell_43) (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse3) .cse4)))))) .cse5) (or (and .cse6 .cse7) (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| .cse8)) (or (and .cse6 (or (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_arrayElimCell_43 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1103) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107) v_arrayElimCell_43) (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse3) .cse4))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1107 .cse1)) v_ArrVal_1107)))) .cse5) .cse7) (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse3)) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1103))) (or (not (= v_ArrVal_1107 (store (select .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1107 .cse1)))) (forall ((v_ArrVal_1105 (Array Int Int))) (let ((.cse10 (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1107 .cse10)) (forall ((v_arrayElimCell_43 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1107) v_arrayElimCell_43) .cse10))))))))) (or (forall ((v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1103) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_1) (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1105) .cse3) .cse4)))) .cse11))))) is different from false [2024-11-18 13:11:19,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse5)) (.cse7 (store |c_#memory_$Pointer$#1.offset| .cse4 (store (select |c_#memory_$Pointer$#1.offset| .cse4) (+ 4 .cse1) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))) (.cse8 (+ .cse0 4)) (.cse6 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))) (let ((.cse2 (or .cse10 (forall ((v_ArrVal_1107 (Array Int Int)) (v_arrayElimCell_41 Int) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| .cse4 v_ArrVal_1103))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1107) v_arrayElimCell_41) (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1105) .cse5) .cse8))) (not (= v_ArrVal_1107 (store (select .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 (select v_ArrVal_1107 .cse6))))))))) (.cse3 (forall ((v_arrayElimCell_41 Int) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| .cse4 v_ArrVal_1103))) (or (forall ((v_ArrVal_1105 (Array Int Int))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1107)) (.cse15 (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1105) .cse5) .cse8))) (or (forall ((v_arrayElimCell_43 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_43) .cse15))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_41) .cse15))))) (not (= v_ArrVal_1107 (store (select .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 (select v_ArrVal_1107 .cse6)))))))) (.cse9 (not .cse10))) (and (or (= .cse0 .cse1) (and .cse2 .cse3)) (or (= .cse4 .cse5) (and .cse2 (or (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_arrayElimCell_43 Int)) (or (not (= v_ArrVal_1107 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 (select v_ArrVal_1107 .cse6)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse4 v_ArrVal_1103) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1107) v_arrayElimCell_43) (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1105) .cse5) .cse8))))) .cse9) .cse3)) (or .cse10 (forall ((v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse4 v_ArrVal_1103) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 v_DerPreprocessor_1) (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1105) .cse5) .cse8))))) (or (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse11 (store |c_#memory_int#1| .cse4 v_ArrVal_1103))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1107) v_arrayElimCell_43) (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1105) .cse5) .cse8))) (not (= v_ArrVal_1107 (store (select .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 (select v_ArrVal_1107 .cse6))))))) .cse9) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| .cse4 v_ArrVal_1103))) (or (forall ((v_ArrVal_1105 (Array Int Int))) (let ((.cse13 (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1105) .cse5) .cse8))) (or (forall ((v_arrayElimCell_43 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1107) v_arrayElimCell_43) .cse13))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1107 .cse13))))) (not (= v_ArrVal_1107 (store (select .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 (select v_ArrVal_1107 .cse6))))))))))) is different from false [2024-11-18 13:11:20,288 INFO L349 Elim1Store]: treesize reduction 405, result has 30.9 percent of original size [2024-11-18 13:11:20,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 56 case distinctions, treesize of input 3669 treesize of output 3764 [2024-11-18 13:11:20,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:11:20,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 2536 treesize of output 2862 [2024-11-18 13:11:21,004 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-18 13:11:21,005 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2434 treesize of output 2445 [2024-11-18 13:11:21,191 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-18 13:11:21,192 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2341 treesize of output 2396 [2024-11-18 13:11:21,364 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 2292 treesize of output 2248 [2024-11-18 13:11:21,566 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-18 13:11:21,567 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2248 treesize of output 2259 [2024-11-18 13:11:21,782 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-18 13:11:21,783 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2155 treesize of output 2210 [2024-11-18 13:11:22,003 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-18 13:11:22,004 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2106 treesize of output 2161 [2024-11-18 13:11:22,196 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 2151 treesize of output 2107 [2024-11-18 13:11:22,501 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-18 13:11:22,501 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2107 treesize of output 2162