./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.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/sll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:25:40,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:25:40,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:25:40,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:25:40,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:25:40,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:25:40,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:25:40,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:25:40,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:25:40,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:25:40,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:25:40,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:25:40,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:25:40,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:25:40,416 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:25:40,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:25:40,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:25:40,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:25:40,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:25:40,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:25:40,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:25:40,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:25:40,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:25:40,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:25:40,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:25:40,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:25:40,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:25:40,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:25:40,421 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:25:40,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:25:40,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:25:40,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:25:40,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:25:40,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:25:40,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:25:40,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:25:40,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:25:40,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:25:40,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:25:40,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:25:40,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:25:40,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:25:40,425 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-10-12 18:25:40,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:25:40,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:25:40,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:25:40,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:25:40,716 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:25:40,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-10-12 18:25:42,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:25:42,691 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:25:42,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-10-12 18:25:42,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b22199a4/1bdaa98bdc8941178f331e6ac3e85d88/FLAGc09056267 [2024-10-12 18:25:42,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b22199a4/1bdaa98bdc8941178f331e6ac3e85d88 [2024-10-12 18:25:42,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:25:42,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:25:42,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:25:42,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:25:42,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:25:42,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:25:42" (1/1) ... [2024-10-12 18:25:42,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20bb2abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:42, skipping insertion in model container [2024-10-12 18:25:42,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:25:42" (1/1) ... [2024-10-12 18:25:42,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:25:43,126 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/sll2c_append_unequal.i[24587,24600] [2024-10-12 18:25:43,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:25:43,160 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:25:43,205 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/sll2c_append_unequal.i[24587,24600] [2024-10-12 18:25:43,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:25:43,235 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:25:43,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43 WrapperNode [2024-10-12 18:25:43,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:25:43,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:25:43,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:25:43,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:25:43,244 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:25:43" (1/1) ... [2024-10-12 18:25:43,261 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:25:43" (1/1) ... [2024-10-12 18:25:43,288 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 161 [2024-10-12 18:25:43,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:25:43,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:25:43,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:25:43,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:25:43,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,333 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 16, 10]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2024-10-12 18:25:43,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:25:43,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:25:43,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:25:43,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:25:43,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:25:43,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:43,408 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:25:43,411 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:25:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:25:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:25:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:25:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:25:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:25:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:25:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-12 18:25:43,464 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-12 18:25:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:25:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:25:43,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:25:43,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:25:43,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:25:43,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 18:25:43,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:25:43,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:25:43,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 18:25:43,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:25:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:25:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:25:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 18:25:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:25:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:25:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:25:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:25:43,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:25:43,631 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:25:43,634 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:25:43,935 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-12 18:25:43,935 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:25:43,979 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:25:43,982 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 18:25:43,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:25:43 BoogieIcfgContainer [2024-10-12 18:25:43,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:25:43,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:25:43,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:25:43,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:25:43,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:25:42" (1/3) ... [2024-10-12 18:25:43,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e97655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:25:43, skipping insertion in model container [2024-10-12 18:25:43,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43" (2/3) ... [2024-10-12 18:25:43,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e97655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:25:43, skipping insertion in model container [2024-10-12 18:25:43,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:25:43" (3/3) ... [2024-10-12 18:25:43,991 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-10-12 18:25:44,008 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:25:44,009 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:25:44,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:25:44,075 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;@5a041c7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:25:44,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:25:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 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:25:44,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:25:44,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:44,091 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:25:44,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:44,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2101823815, now seen corresponding path program 1 times [2024-10-12 18:25:44,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:44,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347380822] [2024-10-12 18:25:44,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:44,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:44,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:44,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:25:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:44,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347380822] [2024-10-12 18:25:44,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347380822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:25:44,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:25:44,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:25:44,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309937725] [2024-10-12 18:25:44,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:25:44,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:25:44,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:25:44,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:25:44,525 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 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) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:25:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:44,758 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2024-10-12 18:25:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:25:44,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-10-12 18:25:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:44,768 INFO L225 Difference]: With dead ends: 62 [2024-10-12 18:25:44,768 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 18:25:44,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:25:44,777 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:44,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:25:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 18:25:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-12 18:25:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-12 18:25:44,814 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 19 [2024-10-12 18:25:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:44,816 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-12 18:25:44,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:25:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-12 18:25:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 18:25:44,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:44,819 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:44,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:25:44,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:44,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash -536293836, now seen corresponding path program 1 times [2024-10-12 18:25:44,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:44,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896776005] [2024-10-12 18:25:44,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:25:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:45,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896776005] [2024-10-12 18:25:45,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896776005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:25:45,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:25:45,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:25:45,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439651547] [2024-10-12 18:25:45,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:25:45,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:25:45,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:45,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:25:45,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:25:45,026 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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:25:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:45,095 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-10-12 18:25:45,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:25:45,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-12 18:25:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:45,097 INFO L225 Difference]: With dead ends: 49 [2024-10-12 18:25:45,098 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 18:25:45,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:25:45,100 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:45,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:25:45,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 18:25:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 18:25:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-12 18:25:45,111 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 20 [2024-10-12 18:25:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:45,112 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-12 18:25:45,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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:25:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-12 18:25:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:25:45,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:45,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:45,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:25:45,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:45,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash 538316138, now seen corresponding path program 1 times [2024-10-12 18:25:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:45,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862537960] [2024-10-12 18:25:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:25:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:25:45,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:45,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862537960] [2024-10-12 18:25:45,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862537960] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:45,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370319991] [2024-10-12 18:25:45,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:45,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:45,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:45,675 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:25:45,677 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:25:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 18:25:45,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:46,005 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:25:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:25:46,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:25:46,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370319991] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:25:46,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:25:46,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 12 [2024-10-12 18:25:46,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947126727] [2024-10-12 18:25:46,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:46,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:25:46,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:46,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:25:46,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:25:46,098 INFO L87 Difference]: Start difference. First operand 28 states and 36 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, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 18:25:50,120 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:25:54,133 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:25:58,149 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:02,167 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:06,380 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:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:06,383 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-10-12 18:26:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:26:06,384 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, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 26 [2024-10-12 18:26:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:06,385 INFO L225 Difference]: With dead ends: 44 [2024-10-12 18:26:06,385 INFO L226 Difference]: Without dead ends: 33 [2024-10-12 18:26:06,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 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:06,386 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:06,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 192 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-10-12 18:26:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-12 18:26:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-12 18:26:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 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:26:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-12 18:26:06,396 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2024-10-12 18:26:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:06,396 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-12 18:26:06,396 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, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 18:26:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-12 18:26:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:26:06,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:06,397 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:06,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:26:06,598 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:06,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash -62087795, now seen corresponding path program 1 times [2024-10-12 18:26:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:06,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331066092] [2024-10-12 18:26:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:07,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:07,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:07,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:07,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331066092] [2024-10-12 18:26:07,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331066092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758829135] [2024-10-12 18:26:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:07,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:07,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:07,508 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:07,509 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:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:07,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-12 18:26:07,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:07,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:26:07,857 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 13 treesize of output 9 [2024-10-12 18:26:07,969 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:26:07,970 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:26:08,057 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 25 treesize of output 13 [2024-10-12 18:26:08,071 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:26:08,184 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-12 18:26:08,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 77 [2024-10-12 18:26:08,197 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 50 treesize of output 21 [2024-10-12 18:26:08,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-10-12 18:26:08,266 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 17 treesize of output 3 [2024-10-12 18:26:08,271 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:26:08,407 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:26:08,407 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 26 treesize of output 29 [2024-10-12 18:26:08,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-12 18:26:08,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:26:08,442 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 46 treesize of output 35 [2024-10-12 18:26:08,461 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-12 18:26:08,461 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 32 treesize of output 34 [2024-10-12 18:26:08,670 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-12 18:26:08,671 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2024-10-12 18:26:08,704 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-10-12 18:26:08,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 93 [2024-10-12 18:26:08,738 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2024-10-12 18:26:08,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 53 [2024-10-12 18:26:08,758 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 12 treesize of output 1 [2024-10-12 18:26:08,801 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-10-12 18:26:08,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 13 [2024-10-12 18:26:08,839 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 45 treesize of output 34 [2024-10-12 18:26:08,848 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 36 treesize of output 29 [2024-10-12 18:26:08,918 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 127 treesize of output 95 [2024-10-12 18:26:09,052 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 114 treesize of output 66 [2024-10-12 18:26:09,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:09,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2024-10-12 18:26:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:26:09,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:09,328 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_471 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_471) .cse0) .cse1) .cse0))) (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_469 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) v_ArrVal_469)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_469) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_468) .cse0) (+ .cse1 4)))))))) is different from false [2024-10-12 18:26:09,388 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_471 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_469) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_468) .cse0) (+ .cse1 4))) (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_469 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) v_ArrVal_469)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_471) .cse0) .cse1) .cse0))))) is different from false [2024-10-12 18:26:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758829135] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:13,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:26:13,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 33 [2024-10-12 18:26:13,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378661523] [2024-10-12 18:26:13,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:13,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-12 18:26:13,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:13,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-12 18:26:13,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1371, Unknown=3, NotChecked=150, Total=1640 [2024-10-12 18:26:13,554 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 33 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-12 18:26:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:14,754 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2024-10-12 18:26:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-12 18:26:14,755 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-10-12 18:26:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:14,757 INFO L225 Difference]: With dead ends: 83 [2024-10-12 18:26:14,757 INFO L226 Difference]: Without dead ends: 75 [2024-10-12 18:26:14,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=262, Invalid=2935, Unknown=3, NotChecked=222, Total=3422 [2024-10-12 18:26:14,759 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:14,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 336 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 18:26:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-12 18:26:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 46. [2024-10-12 18:26:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:26:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-10-12 18:26:14,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 29 [2024-10-12 18:26:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:14,776 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-10-12 18:26:14,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-12 18:26:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-10-12 18:26:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 18:26:14,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:14,778 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:14,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:26:14,981 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:14,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:14,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:14,983 INFO L85 PathProgramCache]: Analyzing trace with hash 509899912, now seen corresponding path program 1 times [2024-10-12 18:26:14,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:14,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102768532] [2024-10-12 18:26:14,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:14,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:15,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:26:16,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:16,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102768532] [2024-10-12 18:26:16,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102768532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:16,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571347914] [2024-10-12 18:26:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:16,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:16,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:16,076 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:16,078 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:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-10-12 18:26:16,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:16,317 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:26:16,439 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 13 treesize of output 9 [2024-10-12 18:26:16,486 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:26:16,486 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:26:16,550 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 25 treesize of output 13 [2024-10-12 18:26:16,658 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 26 treesize of output 21 [2024-10-12 18:26:16,732 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 17 treesize of output 3 [2024-10-12 18:26:16,737 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:26:16,870 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:26:16,871 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 26 treesize of output 29 [2024-10-12 18:26:16,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-12 18:26:16,907 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-12 18:26:16,909 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 20 treesize of output 22 [2024-10-12 18:26:17,125 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 32 [2024-10-12 18:26:17,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:26:17,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 21 [2024-10-12 18:26:17,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-12 18:26:17,186 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 21 treesize of output 13 [2024-10-12 18:26:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:26:17,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:17,394 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array Int Int)) (v_ArrVal_646 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_646) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_647) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_646 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_646 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2024-10-12 18:26:17,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array Int Int)) (v_ArrVal_646 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= v_ArrVal_646 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| (select v_ArrVal_646 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18|)))) (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_646) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_647) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2024-10-12 18:26:17,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array Int Int)) (v_ArrVal_646 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_646) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_647) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_646 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| (select v_ArrVal_646 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18|)))) (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18|)))) is different from false [2024-10-12 18:26:17,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571347914] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:17,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:26:17,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 35 [2024-10-12 18:26:17,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771058387] [2024-10-12 18:26:17,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:17,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-12 18:26:17,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:17,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 18:26:17,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1381, Unknown=4, NotChecked=228, Total=1722 [2024-10-12 18:26:17,564 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 35 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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:26:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:18,552 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2024-10-12 18:26:18,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:26:18,553 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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 31 [2024-10-12 18:26:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:18,553 INFO L225 Difference]: With dead ends: 62 [2024-10-12 18:26:18,554 INFO L226 Difference]: Without dead ends: 48 [2024-10-12 18:26:18,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=213, Invalid=2245, Unknown=4, NotChecked=294, Total=2756 [2024-10-12 18:26:18,555 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 33 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:18,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 437 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:26:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-12 18:26:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-12 18:26:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:26:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-10-12 18:26:18,567 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 31 [2024-10-12 18:26:18,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:18,568 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-10-12 18:26:18,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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:26:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-10-12 18:26:18,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 18:26:18,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:18,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:18,588 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:18,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:18,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:18,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:18,771 INFO L85 PathProgramCache]: Analyzing trace with hash 776284163, now seen corresponding path program 1 times [2024-10-12 18:26:18,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:18,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259966509] [2024-10-12 18:26:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:21,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259966509] [2024-10-12 18:26:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259966509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836145695] [2024-10-12 18:26:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:21,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:21,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:21,160 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:21,162 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:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:21,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-10-12 18:26:21,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:21,463 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:26:21,659 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:26:21,728 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:26:21,728 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:26:21,805 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:26:21,816 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:26:21,902 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:26:21,911 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:26:22,008 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:26:22,014 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:26:22,018 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:26:22,241 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-12 18:26:22,241 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 20 treesize of output 22 [2024-10-12 18:26:22,255 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:26:22,265 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:26:22,718 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 33 [2024-10-12 18:26:22,725 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:26:22,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:26:22,726 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2024-10-12 18:26:23,001 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:26:23,010 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 25 treesize of output 15 [2024-10-12 18:26:23,081 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-12 18:26:23,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:26:23,159 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:26:23,166 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 14 [2024-10-12 18:26:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:26:23,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:23,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-12 18:26:23,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_827) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-10-12 18:26:23,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2024-10-12 18:26:23,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (or (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_arrayElimCell_69 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_69 v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_827) .cse0) .cse1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_arrayElimCell_69 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_69 v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_827) .cse0) .cse1)) (= v_arrayElimCell_69 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) is different from false [2024-10-12 18:26:23,907 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_arrayElimCell_69 Int)) (or (= v_arrayElimCell_69 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_69 v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_827) .cse1) .cse2)))) (or (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_arrayElimCell_69 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_69 v_ArrVal_826) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_827) .cse1) .cse2))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3)))))) is different from false [2024-10-12 18:26:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836145695] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:24,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:26:24,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 49 [2024-10-12 18:26:24,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738212395] [2024-10-12 18:26:24,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:24,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-12 18:26:24,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:24,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-12 18:26:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2868, Unknown=52, NotChecked=330, Total=3422 [2024-10-12 18:26:24,137 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 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:26:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:27,095 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2024-10-12 18:26:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-12 18:26:27,096 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 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 33 [2024-10-12 18:26:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:27,097 INFO L225 Difference]: With dead ends: 91 [2024-10-12 18:26:27,098 INFO L226 Difference]: Without dead ends: 83 [2024-10-12 18:26:27,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=459, Invalid=6290, Unknown=69, NotChecked=492, Total=7310 [2024-10-12 18:26:27,101 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 76 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:27,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 507 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 18:26:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-12 18:26:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2024-10-12 18:26:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:26:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2024-10-12 18:26:27,128 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 33 [2024-10-12 18:26:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:27,128 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2024-10-12 18:26:27,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 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:26:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2024-10-12 18:26:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 18:26:27,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:27,129 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:27,152 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:26:27,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:27,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:27,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:27,331 INFO L85 PathProgramCache]: Analyzing trace with hash -926488386, now seen corresponding path program 2 times [2024-10-12 18:26:27,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:27,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738236146] [2024-10-12 18:26:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:27,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:28,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:26:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:29,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738236146] [2024-10-12 18:26:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738236146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:29,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687701650] [2024-10-12 18:26:29,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:26:29,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:29,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:29,046 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:26:29,047 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:26:29,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:26:29,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:26:29,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 178 conjuncts are in the unsatisfiable core [2024-10-12 18:26:29,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:29,358 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:26:29,528 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:26:29,609 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:26:29,610 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:26:29,697 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:26:29,740 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:26:29,747 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:26:29,859 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-12 18:26:29,860 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 112 treesize of output 58 [2024-10-12 18:26:29,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-12 18:26:29,882 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:26:29,976 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-12 18:26:29,977 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 64 treesize of output 31 [2024-10-12 18:26:29,984 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:26:29,991 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:26:29,996 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:26:30,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:26:30,179 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-12 18:26:30,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2024-10-12 18:26:30,200 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:26:30,201 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:26:30,212 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:26:30,223 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:26:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:26:30,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:35,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (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 (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse6 (store (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1015)) (.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1018))) (let ((.cse1 (select (select .cse0 .cse3) .cse4)) (.cse2 (select (select .cse5 .cse3) .cse4))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse3)) (not (= .cse4 (select (select .cse5 .cse1) .cse2))))))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1012 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse6 (store (select |c_#memory_int#1| .cse6) .cse7 v_ArrVal_1012)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1017) .cse3) (+ .cse4 4)))))) is different from false [2024-10-12 18:26:48,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687701650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:48,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:26:48,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2024-10-12 18:26:48,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418252780] [2024-10-12 18:26:48,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:48,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-12 18:26:48,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:48,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-12 18:26:48,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2093, Unknown=5, NotChecked=92, Total=2352 [2024-10-12 18:26:48,480 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 36 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 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:26:49,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:49,752 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2024-10-12 18:26:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 18:26:49,752 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 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 35 [2024-10-12 18:26:49,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:49,753 INFO L225 Difference]: With dead ends: 81 [2024-10-12 18:26:49,753 INFO L226 Difference]: Without dead ends: 65 [2024-10-12 18:26:49,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=284, Invalid=3375, Unknown=5, NotChecked=118, Total=3782 [2024-10-12 18:26:49,755 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:49,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 341 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 18:26:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-12 18:26:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-10-12 18:26:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:26:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2024-10-12 18:26:49,772 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 35 [2024-10-12 18:26:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:49,772 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2024-10-12 18:26:49,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 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:26:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-10-12 18:26:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:26:49,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:49,773 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:49,791 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:26:49,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:49,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:49,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:49,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1531607570, now seen corresponding path program 1 times [2024-10-12 18:26:49,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:49,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111945696] [2024-10-12 18:26:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:49,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:50,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:26:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111945696] [2024-10-12 18:26:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111945696] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905832026] [2024-10-12 18:26:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:50,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:50,372 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:26:50,373 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:26:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:50,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-10-12 18:26:50,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:50,585 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:26:50,726 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:26:50,727 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:26:50,761 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:26:50,769 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:50,823 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-12 18:26:50,823 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 78 treesize of output 53 [2024-10-12 18:26:50,829 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 24 treesize of output 1 [2024-10-12 18:26:50,867 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:26:50,873 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:26:51,001 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 8 treesize of output 1 [2024-10-12 18:26:51,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:26:51,005 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:26:51,017 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:26:51,018 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:26:51,328 INFO L349 Elim1Store]: treesize reduction 52, result has 43.5 percent of original size [2024-10-12 18:26:51,329 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 4 case distinctions, treesize of input 91 treesize of output 78 [2024-10-12 18:26:51,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-10-12 18:26:51,357 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-12 18:26:51,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2024-10-12 18:26:51,373 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 17 treesize of output 15 [2024-10-12 18:26:51,487 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 0 case distinctions, treesize of input 55 treesize of output 42 [2024-10-12 18:26:51,492 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 8 treesize of output 1 [2024-10-12 18:27:12,737 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-12 18:27:12,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:27:13,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:27:13,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 385 treesize of output 421 [2024-10-12 18:27:14,474 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2024-10-12 18:27:14,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 60 [2024-10-12 18:27:14,479 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-10-12 18:27:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:27:14,485 INFO L311 TraceCheckSpWp]: Computing backward predicates...