./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:26:11,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:26:11,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:26:11,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:26:11,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:26:11,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:26:11,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:26:11,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:26:11,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:26:11,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:26:11,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:26:11,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:26:11,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:26:11,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:26:11,381 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:26:11,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:26:11,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:26:11,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:26:11,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:26:11,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:26:11,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:26:11,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:26:11,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:26:11,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:26:11,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:26:11,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:26:11,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:26:11,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:26:11,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:26:11,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:26:11,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:26:11,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:26:11,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:26:11,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:26:11,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:26:11,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:26:11,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:26:11,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:26:11,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:26:11,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:26:11,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:26:11,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:26:11,394 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-10-12 18:26:11,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:26:11,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:26:11,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:26:11,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:26:11,691 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:26:11,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-10-12 18:26:13,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:26:13,599 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:26:13,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-10-12 18:26:13,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9070fe970/4d01f8cc4f5b4cb78bdaf914feaac9c2/FLAGb8ad0d65a [2024-10-12 18:26:13,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9070fe970/4d01f8cc4f5b4cb78bdaf914feaac9c2 [2024-10-12 18:26:13,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:26:13,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:26:13,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:26:13,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:26:13,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:26:13,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:26:13" (1/1) ... [2024-10-12 18:26:13,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400e30d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:13, skipping insertion in model container [2024-10-12 18:26:13,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:26:13" (1/1) ... [2024-10-12 18:26:14,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:26:14,391 WARN L248 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_append_equal.i[24197,24210] [2024-10-12 18:26:14,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:26:14,447 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:26:14,507 WARN L248 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_append_equal.i[24197,24210] [2024-10-12 18:26:14,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:26:14,535 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:26:14,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14 WrapperNode [2024-10-12 18:26:14,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:26:14,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:26:14,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:26:14,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:26:14,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,580 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2024-10-12 18:26:14,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:26:14,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:26:14,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:26:14,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:26:14,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,621 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 9, 6]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-10-12 18:26:14,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:26:14,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:26:14,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:26:14,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:26:14,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (1/1) ... [2024-10-12 18:26:14,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:26:14,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:14,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:26:14,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:26:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:26:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:26:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:26:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:26:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:26:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:26:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-12 18:26:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-12 18:26:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:26:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:26:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:26:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:26:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:26:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 18:26:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:26:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:26:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 18:26:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:26:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:26:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:26:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 18:26:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:26:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:26:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:26:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:26:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:26:14,856 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:26:14,858 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:26:15,025 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-12 18:26:15,026 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:26:15,064 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:26:15,065 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 18:26:15,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:26:15 BoogieIcfgContainer [2024-10-12 18:26:15,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:26:15,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:26:15,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:26:15,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:26:15,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:26:13" (1/3) ... [2024-10-12 18:26:15,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3714260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:26:15, skipping insertion in model container [2024-10-12 18:26:15,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:26:14" (2/3) ... [2024-10-12 18:26:15,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3714260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:26:15, skipping insertion in model container [2024-10-12 18:26:15,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:26:15" (3/3) ... [2024-10-12 18:26:15,074 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-10-12 18:26:15,090 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:26:15,091 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:26:15,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:26:15,192 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;@38b8de56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:26:15,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:26:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:26:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 18:26:15,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:15,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:15,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:15,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1424445379, now seen corresponding path program 1 times [2024-10-12 18:26:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:15,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707745808] [2024-10-12 18:26:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:26:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:26:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:15,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707745808] [2024-10-12 18:26:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707745808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:26:15,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:26:15,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:26:15,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442565988] [2024-10-12 18:26:15,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:26:15,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:26:15,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:15,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:26:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:26:15,549 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:26:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:15,624 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2024-10-12 18:26:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:26:15,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-12 18:26:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:15,634 INFO L225 Difference]: With dead ends: 46 [2024-10-12 18:26:15,634 INFO L226 Difference]: Without dead ends: 20 [2024-10-12 18:26:15,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:26:15,644 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:15,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:26:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-12 18:26:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-12 18:26:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-10-12 18:26:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-10-12 18:26:15,687 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2024-10-12 18:26:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:15,688 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-10-12 18:26:15,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:26:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-10-12 18:26:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 18:26:15,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:15,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:15,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:26:15,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:15,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash 391783627, now seen corresponding path program 1 times [2024-10-12 18:26:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:15,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829725948] [2024-10-12 18:26:15,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:26:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:26:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829725948] [2024-10-12 18:26:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829725948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:26:15,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:26:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:26:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569185175] [2024-10-12 18:26:15,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:26:15,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:26:15,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:15,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:26:15,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:26:15,883 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:26:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:15,919 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-10-12 18:26:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:26:15,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-12 18:26:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:15,921 INFO L225 Difference]: With dead ends: 39 [2024-10-12 18:26:15,921 INFO L226 Difference]: Without dead ends: 23 [2024-10-12 18:26:15,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:26:15,923 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:15,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:26:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-12 18:26:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-12 18:26:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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-10-12 18:26:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-10-12 18:26:15,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2024-10-12 18:26:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:15,930 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-12 18:26:15,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:26:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-10-12 18:26:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:26:15,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:15,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:15,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:26:15,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:15,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:15,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1783597384, now seen corresponding path program 1 times [2024-10-12 18:26:15,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:15,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165974985] [2024-10-12 18:26:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:26:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 18:26:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:16,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:16,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165974985] [2024-10-12 18:26:16,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165974985] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:16,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611446794] [2024-10-12 18:26:16,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:16,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:16,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:16,208 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-10-12 18:26:16,210 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-10-12 18:26:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:26:16,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:26:16,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611446794] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:26:16,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:26:16,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-12 18:26:16,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222970616] [2024-10-12 18:26:16,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:16,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:26:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:16,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:26:16,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:26:16,474 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 18:26:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:16,534 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-12 18:26:16,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:26:16,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2024-10-12 18:26:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:16,535 INFO L225 Difference]: With dead ends: 40 [2024-10-12 18:26:16,535 INFO L226 Difference]: Without dead ends: 24 [2024-10-12 18:26:16,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:26:16,538 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:16,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:26:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-12 18:26:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-12 18:26:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-10-12 18:26:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-12 18:26:16,549 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2024-10-12 18:26:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:16,550 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-12 18:26:16,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 18:26:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-12 18:26:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:26:16,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:16,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:16,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 18:26:16,755 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-10-12 18:26:16,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:16,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:16,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1298850533, now seen corresponding path program 2 times [2024-10-12 18:26:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:16,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23524744] [2024-10-12 18:26:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:17,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:26:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:17,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:26:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:17,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:26:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:26:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:17,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23524744] [2024-10-12 18:26:17,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23524744] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:17,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385799429] [2024-10-12 18:26:17,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:26:17,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:17,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:17,466 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-10-12 18:26:17,474 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-10-12 18:26:17,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 18:26:17,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:26:17,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 18:26:17,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:17,782 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-10-12 18:26:17,791 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-10-12 18:26:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:26:17,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:26:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385799429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:26:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:26:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 19 [2024-10-12 18:26:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922765563] [2024-10-12 18:26:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:26:17,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 18:26:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 18:26:17,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2024-10-12 18:26:17,797 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:26:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:17,866 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-12 18:26:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 18:26:17,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-12 18:26:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:17,868 INFO L225 Difference]: With dead ends: 34 [2024-10-12 18:26:17,868 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:26:17,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:26:17,869 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:17,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:26:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:26:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2024-10-12 18:26:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:26:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-10-12 18:26:17,875 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 25 [2024-10-12 18:26:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:17,875 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-10-12 18:26:17,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:26:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-10-12 18:26:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:26:17,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:17,877 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:17,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 18:26:18,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-12 18:26:18,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:18,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1298852207, now seen corresponding path program 1 times [2024-10-12 18:26:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:18,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047114073] [2024-10-12 18:26:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:18,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:18,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:26:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:18,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:26:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:18,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:26:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:26:18,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:18,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047114073] [2024-10-12 18:26:18,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047114073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:26:18,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:26:18,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 18:26:18,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127493061] [2024-10-12 18:26:18,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:26:18,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:26:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:26:18,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:26:18,480 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:26:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:18,624 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-12 18:26:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 18:26:18,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-12 18:26:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:18,626 INFO L225 Difference]: With dead ends: 34 [2024-10-12 18:26:18,626 INFO L226 Difference]: Without dead ends: 32 [2024-10-12 18:26:18,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-12 18:26:18,627 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:18,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:26:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-12 18:26:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2024-10-12 18:26:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-10-12 18:26:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-10-12 18:26:18,632 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 25 [2024-10-12 18:26:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:18,632 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-12 18:26:18,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:26:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-10-12 18:26:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:26:18,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:18,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:18,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:26:18,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:18,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1638479424, now seen corresponding path program 1 times [2024-10-12 18:26:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:18,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137276496] [2024-10-12 18:26:18,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:18,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:26:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:18,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:26:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:18,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:26:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:26:18,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:18,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137276496] [2024-10-12 18:26:18,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137276496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:18,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873614844] [2024-10-12 18:26:18,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:18,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:18,849 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-10-12 18:26:18,850 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-10-12 18:26:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:18,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 18:26:18,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:19,060 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-10-12 18:26:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:26:19,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:26:19,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873614844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:26:19,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:26:19,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 12 [2024-10-12 18:26:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191459295] [2024-10-12 18:26:19,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:19,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:26:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:19,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:26:19,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:26:19,110 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 18:26:23,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:27,142 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-10-12 18:26:31,169 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-10-12 18:26:35,180 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-10-12 18:26:39,203 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-10-12 18:26:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:39,344 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-12 18:26:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:26:39,344 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 27 [2024-10-12 18:26:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:39,345 INFO L225 Difference]: With dead ends: 35 [2024-10-12 18:26:39,345 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 18:26:39,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-12 18:26:39,346 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:39,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 155 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2024-10-12 18:26:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 18:26:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-12 18:26:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-10-12 18:26:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-12 18:26:39,356 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 27 [2024-10-12 18:26:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:39,357 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-12 18:26:39,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 18:26:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-12 18:26:39,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:26:39,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:39,358 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:39,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 18:26:39,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:39,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1736900497, now seen corresponding path program 1 times [2024-10-12 18:26:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545865278] [2024-10-12 18:26:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:26:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:26:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:26:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:26:39,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:39,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545865278] [2024-10-12 18:26:39,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545865278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:39,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31661362] [2024-10-12 18:26:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:39,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:39,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:39,920 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-10-12 18:26:39,922 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-10-12 18:26:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:40,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 18:26:40,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:40,209 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-10-12 18:26:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:40,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:26:40,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31661362] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:26:40,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:26:40,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 16 [2024-10-12 18:26:40,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509806087] [2024-10-12 18:26:40,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:40,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:26:40,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:40,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:26:40,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:26:40,261 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:26:44,268 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-10-12 18:26:48,288 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-10-12 18:26:52,323 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-10-12 18:26:56,359 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-10-12 18:27:00,410 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-10-12 18:27:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:27:00,593 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-10-12 18:27:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:27:00,594 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2024-10-12 18:27:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:27:00,595 INFO L225 Difference]: With dead ends: 31 [2024-10-12 18:27:00,595 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 18:27:00,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-10-12 18:27:00,596 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:27:00,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 213 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2024-10-12 18:27:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 18:27:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 18:27:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-10-12 18:27:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-12 18:27:00,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2024-10-12 18:27:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:27:00,602 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-12 18:27:00,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:27:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-12 18:27:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:27:00,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:27:00,603 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:27:00,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 18:27:00,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:00,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:27:00,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:27:00,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1736898823, now seen corresponding path program 1 times [2024-10-12 18:27:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:27:00,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322706017] [2024-10-12 18:27:00,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:00,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:27:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:01,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:27:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:27:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:01,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:27:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:27:01,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:27:01,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322706017] [2024-10-12 18:27:01,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322706017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:01,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74410032] [2024-10-12 18:27:01,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:01,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:01,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:27:01,730 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-10-12 18:27:01,735 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-10-12 18:27:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:01,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-12 18:27:01,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:27:01,988 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-10-12 18:27:01,999 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-10-12 18:27:02,062 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-10-12 18:27:02,168 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-10-12 18:27:02,172 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-10-12 18:27:02,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-10-12 18:27:02,274 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_45| Int)) (let ((.cse0 (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_45|))) (and (= |c_node_create_#in~data#1| (select .cse0 0)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_45| .cse0)) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_45|) 0))))) is different from true [2024-10-12 18:27:02,340 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-12 18:27:02,341 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-10-12 18:27:02,348 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-10-12 18:27:02,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-10-12 18:27:02,619 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-10-12 18:27:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-10-12 18:27:02,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:27:02,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:27:02,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 62 [2024-10-12 18:27:02,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74410032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:02,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:27:02,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2024-10-12 18:27:02,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083828299] [2024-10-12 18:27:02,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:27:02,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-12 18:27:02,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:27:02,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 18:27:02,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=765, Unknown=16, NotChecked=56, Total=930 [2024-10-12 18:27:02,993 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 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-10-12 18:27:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:27:03,868 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-10-12 18:27:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 18:27:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 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 28 [2024-10-12 18:27:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:27:03,873 INFO L225 Difference]: With dead ends: 41 [2024-10-12 18:27:03,873 INFO L226 Difference]: Without dead ends: 39 [2024-10-12 18:27:03,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=1327, Unknown=16, NotChecked=74, Total=1560 [2024-10-12 18:27:03,877 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:27:03,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 372 Invalid, 0 Unknown, 41 Unchecked, 0.4s Time] [2024-10-12 18:27:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-12 18:27:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2024-10-12 18:27:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:27:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-10-12 18:27:03,896 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2024-10-12 18:27:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:27:03,896 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-10-12 18:27:03,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 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-10-12 18:27:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-10-12 18:27:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 18:27:03,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:27:03,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:27:03,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:27:04,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:04,099 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:27:04,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:27:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1582542026, now seen corresponding path program 1 times [2024-10-12 18:27:04,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:27:04,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607402384] [2024-10-12 18:27:04,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:27:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:04,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:27:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:04,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:27:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:27:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:27:05,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:27:05,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607402384] [2024-10-12 18:27:05,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607402384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:05,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232306186] [2024-10-12 18:27:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:05,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:05,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:27:05,154 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-10-12 18:27:05,166 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-10-12 18:27:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:05,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-12 18:27:05,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:27:05,355 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-10-12 18:27:05,426 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 1 [2024-10-12 18:27:05,509 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 18 treesize of output 4 [2024-10-12 18:27:05,514 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-10-12 18:27:05,553 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_54| Int)) (and (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_54| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_54|)) |c_#memory_$Pointer$#1.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_54|) 0))) is different from true [2024-10-12 18:27:05,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:27:05,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-10-12 18:27:05,582 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-12 18:27:05,582 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-10-12 18:27:05,695 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2024-10-12 18:27:05,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2024-10-12 18:27:05,703 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 26 treesize of output 18 [2024-10-12 18:27:05,706 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 22 treesize of output 14 [2024-10-12 18:27:05,729 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 8 [2024-10-12 18:27:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-12 18:27:05,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:27:06,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232306186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:06,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:27:06,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 30 [2024-10-12 18:27:06,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359206091] [2024-10-12 18:27:06,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:27:06,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-12 18:27:06,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:27:06,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 18:27:06,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=902, Unknown=6, NotChecked=60, Total=1056 [2024-10-12 18:27:06,035 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-12 18:27:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:27:06,509 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-10-12 18:27:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 18:27:06,509 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 30 [2024-10-12 18:27:06,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:27:06,511 INFO L225 Difference]: With dead ends: 44 [2024-10-12 18:27:06,511 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 18:27:06,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=1502, Unknown=6, NotChecked=78, Total=1722 [2024-10-12 18:27:06,513 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:27:06,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 238 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 439 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2024-10-12 18:27:06,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 18:27:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-10-12 18:27:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:27:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-10-12 18:27:06,520 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 30 [2024-10-12 18:27:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:27:06,520 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-10-12 18:27:06,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-12 18:27:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-10-12 18:27:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 18:27:06,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:27:06,521 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:27:06,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 18:27:06,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:06,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:27:06,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:27:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1135989524, now seen corresponding path program 1 times [2024-10-12 18:27:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:27:06,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499620387] [2024-10-12 18:27:06,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:27:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:07,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:27:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:07,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:27:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:07,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:27:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:27:07,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:27:07,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499620387] [2024-10-12 18:27:07,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499620387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:07,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746094676] [2024-10-12 18:27:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:07,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:07,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:27:07,813 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-10-12 18:27:07,814 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-10-12 18:27:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:08,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-10-12 18:27:08,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:27:08,104 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-10-12 18:27:08,243 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-10-12 18:27:08,296 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:27:08,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:27:08,403 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-10-12 18:27:08,409 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-10-12 18:27:08,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-12 18:27:08,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-12 18:27:08,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:27:08,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-10-12 18:27:08,675 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_63| Int)) (let ((.cse0 (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_63|))) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_63|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_63| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_63|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_63| .cse0)) (= (select .cse0 0) |c_node_create_#in~data#1|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-10-12 18:27:08,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:27:08,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-10-12 18:27:08,718 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:27:08,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-12 18:27:08,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:27:08,986 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 40 treesize of output 16 [2024-10-12 18:27:09,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-10-12 18:27:09,228 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-10-12 18:27:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-12 18:27:09,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:27:09,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1177) (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-10-12 18:27:09,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:27:09,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2024-10-12 18:27:09,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746094676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:09,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:27:09,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2024-10-12 18:27:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412441648] [2024-10-12 18:27:09,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:27:09,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-12 18:27:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:27:09,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-12 18:27:09,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1479, Unknown=34, NotChecked=158, Total=1806 [2024-10-12 18:27:09,604 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 39 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:27:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:27:10,638 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-10-12 18:27:10,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 18:27:10,639 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2024-10-12 18:27:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:27:10,640 INFO L225 Difference]: With dead ends: 48 [2024-10-12 18:27:10,640 INFO L226 Difference]: Without dead ends: 46 [2024-10-12 18:27:10,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=224, Invalid=2402, Unknown=34, NotChecked=202, Total=2862 [2024-10-12 18:27:10,642 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 18:27:10,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 266 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 634 Invalid, 0 Unknown, 48 Unchecked, 0.5s Time] [2024-10-12 18:27:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-12 18:27:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2024-10-12 18:27:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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-10-12 18:27:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-12 18:27:10,649 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 30 [2024-10-12 18:27:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:27:10,649 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-12 18:27:10,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:27:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-12 18:27:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:27:10,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:27:10,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:27:10,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 18:27:10,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:10,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:27:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:27:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash 764273839, now seen corresponding path program 1 times [2024-10-12 18:27:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:27:10,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208653746] [2024-10-12 18:27:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:10,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:27:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:27:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:12,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:27:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:27:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:27:13,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:27:13,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208653746] [2024-10-12 18:27:13,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208653746] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:13,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78982800] [2024-10-12 18:27:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:13,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:13,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:27:13,309 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:27:13,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 18:27:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:13,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-12 18:27:13,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:27:13,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:27:13,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:27:13,771 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 23 treesize of output 11 [2024-10-12 18:27:13,996 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:27:13,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:27:14,014 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 16 treesize of output 11 [2024-10-12 18:27:14,087 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-10-12 18:27:14,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:27:14,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 18:27:14,300 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 57 treesize of output 25 [2024-10-12 18:27:14,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-12 18:27:14,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:27:14,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-12 18:27:18,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:27:18,999 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 65 treesize of output 42 [2024-10-12 18:27:19,032 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:27:19,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-12 18:27:19,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-12 18:27:19,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:27:20,450 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2024-10-12 18:27:20,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 42 [2024-10-12 18:27:20,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-12 18:27:20,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-12 18:27:20,711 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 70 treesize of output 42 [2024-10-12 18:27:20,908 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 35 treesize of output 19 [2024-10-12 18:27:20,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:27:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:27:21,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:27:21,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1352 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1349)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= v_ArrVal_1349 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1349 .cse0)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (+ .cse4 4))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1352)) .cse2) .cse3)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) .cse2) .cse3)))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse1 .cse2) .cse4)))))) is different from false [2024-10-12 18:27:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78982800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:23,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:27:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 52 [2024-10-12 18:27:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591880760] [2024-10-12 18:27:23,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:27:23,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-12 18:27:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:27:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-12 18:27:23,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3587, Unknown=5, NotChecked=120, Total=3906 [2024-10-12 18:27:23,472 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 52 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 42 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:27:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:27:28,528 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-10-12 18:27:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-12 18:27:28,529 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 42 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2024-10-12 18:27:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:27:28,530 INFO L225 Difference]: With dead ends: 49 [2024-10-12 18:27:28,530 INFO L226 Difference]: Without dead ends: 47 [2024-10-12 18:27:28,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=394, Invalid=6409, Unknown=7, NotChecked=162, Total=6972 [2024-10-12 18:27:28,532 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 18:27:28,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 336 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 18:27:28,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-12 18:27:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-10-12 18:27:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-10-12 18:27:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-10-12 18:27:28,541 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2024-10-12 18:27:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:27:28,541 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-10-12 18:27:28,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 42 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:27:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-10-12 18:27:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:27:28,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:27:28,543 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:27:28,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 18:27:28,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 18:27:28,745 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:27:28,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:27:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash 317719663, now seen corresponding path program 2 times [2024-10-12 18:27:28,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:27:28,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916403995] [2024-10-12 18:27:28,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:28,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:27:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:30,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:27:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:27:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:30,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:27:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:27:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:27:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916403995] [2024-10-12 18:27:31,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916403995] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779803673] [2024-10-12 18:27:31,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:27:31,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:31,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:27:31,096 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:27:31,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 18:27:31,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:27:31,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:27:31,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-10-12 18:27:31,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:27:31,426 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-10-12 18:27:31,582 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-10-12 18:27:31,863 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-10-12 18:27:31,989 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:27:31,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-12 18:27:32,026 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:27:32,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:27:32,156 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-10-12 18:27:32,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-12 18:27:32,184 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-10-12 18:27:32,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-10-12 18:27:32,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-12 18:27:32,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-12 18:27:32,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:27:32,704 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_81| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_81| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_81|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_81| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_81|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_81|) 0) (= (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_81| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_81|)) |c_#memory_$Pointer$#1.offset|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))) is different from true [2024-10-12 18:27:32,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:27:32,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-10-12 18:27:32,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:27:32,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:27:32,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-10-12 18:27:32,793 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:27:32,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-12 18:27:32,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:27:33,215 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 43 treesize of output 19 [2024-10-12 18:27:33,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-12 18:27:33,772 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2024-10-12 18:27:33,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2024-10-12 18:27:33,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-12 18:27:33,899 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-10-12 18:27:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-12 18:27:34,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:27:34,232 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1526 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_38| Int)) (or (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_append_~last~0#1.base_38| v_ArrVal_1526) (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|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (let ((.cse0 (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_append_~last~0#1.base_38|) .cse0 (select v_ArrVal_1526 .cse0))) v_ArrVal_1526)))) is different from false [2024-10-12 18:27:34,258 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1526 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_38| Int)) (or (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_append_~last~0#1.base_38| v_ArrVal_1526) (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|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_1526 (let ((.cse0 (+ (let ((.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)))) 4))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_append_~last~0#1.base_38|) .cse0 (select v_ArrVal_1526 .cse0))))))) is different from false [2024-10-12 18:27:34,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1526 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_38| Int)) (or (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_append_~last~0#1.base_38| v_ArrVal_1526) (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|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_1526 (let ((.cse0 (+ (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 4))) 4))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_append_~last~0#1.base_38|) .cse0 (select v_ArrVal_1526 .cse0))))))) is different from false [2024-10-12 18:27:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779803673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:34,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:27:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2024-10-12 18:27:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826285946] [2024-10-12 18:27:34,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:27:34,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-12 18:27:34,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:27:34,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-12 18:27:34,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1755, Unknown=13, NotChecked=348, Total=2256 [2024-10-12 18:27:34,552 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 43 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:27:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:27:37,496 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-10-12 18:27:37,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-12 18:27:37,497 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2024-10-12 18:27:37,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:27:37,497 INFO L225 Difference]: With dead ends: 71 [2024-10-12 18:27:37,498 INFO L226 Difference]: Without dead ends: 69 [2024-10-12 18:27:37,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=301, Invalid=3862, Unknown=13, NotChecked=516, Total=4692 [2024-10-12 18:27:37,499 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:27:37,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 270 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 723 Invalid, 0 Unknown, 72 Unchecked, 1.1s Time] [2024-10-12 18:27:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-12 18:27:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2024-10-12 18:27:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 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-10-12 18:27:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-10-12 18:27:37,509 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 32 [2024-10-12 18:27:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:27:37,510 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-10-12 18:27:37,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:27:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-10-12 18:27:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 18:27:37,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:27:37,511 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:27:37,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 18:27:37,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:37,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:27:37,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:27:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash 27784448, now seen corresponding path program 1 times [2024-10-12 18:27:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:27:37,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226906097] [2024-10-12 18:27:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:27:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:27:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:27:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 18:27:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:27:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:27:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226906097] [2024-10-12 18:27:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226906097] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25108659] [2024-10-12 18:27:40,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:27:40,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:27:40,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:27:40,299 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:27:40,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 18:27:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:27:40,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-12 18:27:40,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:27:40,633 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-10-12 18:27:40,957 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:27:40,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:27:41,054 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-10-12 18:27:41,062 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-10-12 18:27:41,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-12 18:27:41,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-12 18:27:41,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:27:41,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:27:41,651 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 38 treesize of output 27 [2024-10-12 18:27:41,676 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:27:41,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-12 18:27:41,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-10-12 18:27:42,418 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-12 18:27:42,418 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 140 treesize of output 70 [2024-10-12 18:27:42,424 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-10-12 18:27:42,560 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 79 treesize of output 51 [2024-10-12 18:27:42,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-12 18:27:42,873 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:27:42,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-10-12 18:27:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:27:42,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:27:44,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25108659] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:27:44,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:27:44,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 47 [2024-10-12 18:27:44,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889104233] [2024-10-12 18:27:44,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:27:44,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-12 18:27:44,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:27:44,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-12 18:27:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2903, Unknown=13, NotChecked=0, Total=3080 [2024-10-12 18:27:44,021 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 47 states, 40 states have (on average 1.275) internal successors, (51), 38 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)